2.2 Normal Forms 2.2.1 Conjunctive Normal Form 5. (15 points) For each of the following formulas, find an equivalent formula in CNF. (NB: You may use the CNF algorithm if you would like, but there might be more efficient approaches.) (a) - (( PA q AT) V ( -PAEAT) V (-9 AT)); ( b ) ( p - ( q A T ) ) A - (q #+ T ) A ( ( 9 VT ) -+ p); (c) ( P -+ (9-+ 7)) - ((p-+ 9) -+ (p-+ +) ). 2.2.2 Disjunctive Normal Form 6. (15 points) (a) Describe an algorithm for converting any given formula into an equivalent formula in DNF. (b) Using your algorithm or otherwise, for each of the following formulas, find an equivalent formula in DNF. i. (p ++ q) + T; ii. (PVq) A (PVT) A (PVS)