Two well-known NP-complete problems are 3-SAT and TSP, the traveling salesman problem. The 2-SAT problem is a SAT variant in which each clause contains at most two literals. 2-SAT is known to have a polynomial-time algorithm. Is each of the following statements true or false? Justify your answer.

a. 3-SAT p TSP.

b. If P NP, then 3-SAT p 2-SAT.

c. If P NP, then no NP-complete problem can be solved in polynomial time