1 ) THREE_SOLN_CNF_SAT: Given a Boolean expression in CNF, thereare at least three different assignments of truth values that makethe expression true
find
a. Give yes and no instances.
b. Prove the problem is in NP:
c. Prove the problem is NP-Hard
d. . Prove the problem is NP-Complete
Answer