Let P be a set of points in the plane in convex position { i. e., if you wrap a rubber band around the points, all points touch the rubber band. Formally, for each point p, there is a line that separates p from the other points. Suppose the points are ordered in counterclockwise order, starting from the leftmost point P[1]. Solve a special case of the traveling salesman path problem, in which the salesman must visit every point of P and the cost of moving from one point to another is the Euclidean distance between the two points. Notice that the salesman can start at any vertex and stop at any vertex. Your algorithm must be in polynomial time. dynamic programming