Consider the following decision problem:
4-SAT: Given a gormula in Conjunctive Normal Form, where eachclause contains exactly 4 literals, does it have a satisfyinghtruth assignment?
(i) Prove that 4-SAT
NP
(ii) Prove that 4-SAT
NP Hard
(iii) Thereby prove that 4-SAT
NP Complete
Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .