1. The Traveling Salesman problem (TSP) is a famous problem for which there is no known, tractable solution (though efficient, approximate solutions exist) Given a list of cities and the distances in between, the task is to find the shortest possible tour (a closed walk in which all edges are distinct) that visits each city exactly once Consider the following algorithm for solving the TSP n-number of cities m-nxnmatrix of distances between cities min -(infinity) for all possible tours, do find the length of the tour if length