Using truth table, prove the following logical equivalence
`(p^^q) rarr r -= p rarr (q rarr r)`

Explanation

To prove the logical equivalence \((p \land q) \rightarrow r \equiv p \rightarrow (q \rightarrow r)\) using a truth table, we will follow these steps:

### Step 1: Create the Truth Table

We will create a truth table that includes all possible values of \(p\), \(q\), and \(r\). Each variable can be either True (T) or False (F).

| \(p\) | \(q\) | \(r\) | \(p \land q\) | \((p \land q) \rightarrow r\) | \(q \rightarrow r\) | \(p \rightarrow (q \rightarrow r)\) |
|-------|-------|-------|----------------|-------------------------------|---------------------|-------------------------------------|
...