Problem. Let k3. Recall that the k-SAT problem is the special case of SAT where f(x1,,xn) is a CNF with exactly k distinct variables per clause. 1. Show that a polynomial time algorithm for k-SAT implies a polynomial time algorithm for (k+1)SAT 2. Show that a polynomial time algorithm for (k+1) SAT implies a polynomial time algorithm for k-SAT