4. True or False, (a) (2 poiats) Assume P = NP, Consider a version of the Traveling Salesperson Problem (ISP) where all distances between every two points must be either 1 or 2 . For this problem, an optimal tour can be computed in polynomial time: True Prisie (b) (2. points) Let VC denote the following optimization problem: given a graph, compute the size of the minimum-size vertex cover, Let VC-D denote the following decision problem: given a graph VC-D is polynomial-time solvable, then so is VC. True False