$4.$ The travelling salesman problem $($also called the travelling salesperson problem or TSP$)$ asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" Apply the TSP algorithm to the following table $/$ graph