In this question, you will show that two problems have essentially the same difficulty. In formulating the 3-SAT instance, you may use greaterthanorequalto (x_1, x_2, ..., x_m) as notation for a 3-CNF constraint with O(nk) clauses that specifies that at least k of the variables x_1 through x_m should be true. (a) Prove that 3-SAT lessthanorequalto P Independent Set. (b) Prove that Independent Set lessthanorequalto p 3-SAT