10.) (4 pts) Use Theorem 2.1.1 (not a truth table) to verify the logical equivalence: (p^(-(~p va))) v (p^) = p. 11.) (4 pts) Construct a truth table for the statement form ( pr) (q + r). Theorem 2.1.1 Logical Equivalences Given any statement variables p., and , a tautology t and a contradictione, the following logical equivalences hold 1. Commutative laws: PAQ QAP Pvq4VP 2. Associative laws: (9) Arp (AT) (pv) vrpa) 3. Distributive laws: pqr) - p/9) VAD PVC)= (pv) (p) 4. Identiry laws. p/t-P 5. Negation laws: 6. Double negative law: -(-p) p 7. Idempotent laws: PAPP 8. Universal bound laws: pat PAcc 9. De Morgan's laws. (9) P9 (V4) --- 10. Absorption laws: ) PAV4) - P 11. Negations of tande: -cut