Show that the compound statements `(pvvq)^^~p` and `~ p^^q` are logically equivalent.

Explanation

To show that the compound statements \( (p \lor q) \land \neg p \) and \( \neg p \land q \) are logically equivalent, we will use a truth table.

### Step 1: Write down the statements
We have two statements:
1. \( A = (p \lor q) \land \neg p \)
2. \( B = \neg p \land q \)

### Step 2: Create a truth table
...