For any statements p, show that .
` (i) p vee ~ p` is a tautology , ( ii) ` p ^^ ~ p` is a contradiction

Explanation

To show that \( p \vee \neg p \) is a tautology and \( p \wedge \neg p \) is a contradiction, we will construct truth tables for both expressions.

### Step 1: Construct the Truth Table for \( p \vee \neg p \)

1. **List all possible truth values for \( p \)**:
- \( p \) can either be True (T) or False (F). Thus, we have:
- Row 1: \( p = T \)
- Row 2: \( p = F \)
...