k-SAT is the set of satisfiable Boolean formulas with exactly k literals per clause. Use polynomial time reductions to show that 3-SAT is equivalent to 4-SAT. (a) Show that 3-SAT is not more difficult than 4-SAT. (b) Show that 4-SAT is not more difficult than 3-SAT.