here is previous exercisementioned in this question
https://www.chegg.com/homework-help/questions-and-answers/proof-reduces-3sat-clique-polynomial-time-construction-produces-graph-every-cnf-formula-3–q37100435?trackid=nWDVw5n6
. Say that two Boolean formulas are equivalent if they have the same set of variables and are true on the same set of assignments to those variables (i.e., they describe the same Boolean function). A Boolean formula is minimal if no shorter Boolean formula is equivalent to it. Let MIN-FORMULA be the collection of minimal Boolean formulas. Show that if P-NP. then MIN-FORMÚLA E P.
OR
OR