Theory of Computation Solutions to HW-4 (10 points) Exercise 1 (1 pt for each correct answer). For each of the following statements indicate 1. If a problem can be solved in exponential time, it can also be solved in polynomial 2. If a problem can be solved by a polynomial-time nondeterministic Turing machine, it 3. If a problem can be solved by a polynomial-time nondeterministic Turing machine, it 4. If a problem can be solved by an exponential-time deterministic Turing machine, it whether it is true, false, or unknown time. can also be solved by a polynomial-time deterministic Turing machine. can also be solved by an exponential-time deterministic Turing machine. can also be solved by a polynomial-time nondeterministic Turing machine