Independent Sets and 4-SAT. A Boolean formula is said to be in 4-CNF form it is a conjunction of clauses, each clause contains 4 literals, and each literal is either a Boolean variable or its negation. Prove that Independent Set SP 4-SAT. That is, describe and algorithm that, for a given a Boolean formula in 4-CNF form (with n variables and m clauses), constructs a graph Ga-(V, E) and finds an integer kip E N such that G has an independent set of size at least if and only if is satisfiable