2. (3pts)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. Are the following statements true or false? Justify your answer.

a.3-SAT pTSP.

b.If P NP, then 3-SAT p2-SAT.

c.If TSPp2-SAT, then P = NP.