Consider the following decision problem: 4-SAT: Given a formula in Conjunctive Normal Form, where each clause contains exactly 4 literals. does it have a satisfying truth assignment? (i) Prove that 4-SAT E NP (ii) Prove that 4-SAT ? NP Hard (iii) Thereby prove that 4-SAT NP Complete