(a) True False If P = NP, then all prob an be solved in polynomial time. (b) True False There seem t

(a) True False If P = NP, then all prob an be solved in polynomial time. (b) True False There seem to be some pr hat are in between P and NP-complete. (c) True False If a problem instance can be so a candidate solution can be ver e solved in polynomial time, then ution can be verified in polynomial time. (d) True False If P = NP, then all problems in NP in practice even for large inputs. problems in NP can be quickly solved (e) True False The traveling salesman problem (TSP) salesman problem (TSP) is in PSPACE. (f) True False Comparison-based sorting methods hav of O(n log n) on their running time. -based sorting methods have a lower bound