(2 points) Assume P= NP. Consider a version of the Traveling Salesperson Problem (TSP) 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 False