Which of the following statements is equivalent to the Cook-Levin Theorem? Select one: Every problem that can be solved by a Turing Machine can be polynomially reduced to an instance of SAT. The Halting problem HALTTM for Turing Machines is undecidable. Every problem whose solutions can be verified in polynomial time can be polynomially reduced to an instance of SAT. Every problem that can be solved in polynomial time can be polynomially reduced to an instance of SAT. Every problem whose solutions can be verified in polynomial time can be solved in polynomial time