Consider the following 5-city travelling salesman problem. The distance between each city (in miles) is shown in the following table:
(a) find out the IP whose solution would solve this TSP
(b) Use the optimization solver package like LINDO, LINGO, and Xpress to compute the optimal solution
(c) Use the branch-and-bound algorithm to find the optimal solution (Show thorough procedure)