The traveling salesman problem consists of a salesman and a set of cities. The salesman has to visit each one of the cities starting from a certain one (e.g. the hometown) and returning to the same city. The challenge of the problem is that the traveling salesman wants to minimize the total length of the trip. 1. Problem data: . Starting from city 1, the salesman must travel to all cities once before returning home. The distance between each city is given, and is assumed to be the same in both directions. Only the links shown are to be used. . Objective: Minimize the total distance to be travelled 1 N 9 10 12 2. Write a C++ Program that will identify the following: a. Possible number of paths to use 11 11 b. The path that will generate the minimum distance travelled c. The minimum distance travelled 10