Consider a modified sat problem, sat’ in which given a cnf formula having m clauses and n variables x1, x2,. . . , xn, the output is yes if there is an assignment to the variables such that exactly m − 2 clauses are satisfied, and no otherwise. Prove that sat’ is np-complete.