below matrix represents the distance of 5 cities from each other. represent it in the form of a graph a b c d e a 0 2 3 20 1 b 2 0 15 2 20 c 3 15 0 20 13 d 20 2 20 0 9 e 1 20 13 9 0 b. apply nearest-neighbor heuristic to this matrix and find the approximate solution for this matrix if it were for tsp problem. c. what is the approximation ratio of your approximate solution? d. implement travelling salesman problem using the nearest-neighbor heuristic.
