Tessellate S.T.E.M.S - Computer Science - College - Set 1 - Problem 5

Which of the following are true if P = NP?

1. There exists a polynomial time approximation algorithm for the general travelling salesman problem.
2. Any language recognized by a non-deterministic push-down automaton can be recognized by a deterministic push-down automaton.
3. PSPACE = NPSPACE
4. There exists an algorithm to check if a Turing machine halts on a given input.
5. Graph isomorphism problem can be solved in polynomial time.

Note: If an option is true, as is, but not as a direct consequence, we will consider it to be part of the answer.

This problem is a part of Tessellate S.T.E.M.S.