(a) find initial TSP tour using Nearest neighbor constructive heuristic;

(b) find initial TSP tour using Greedy add constructive heuristic;

(c) starting from Greedy-add initial solution, perform 1-opt local search;

(d) find Minimum spanning tree of corresponding complete graph, using Greedy algorithm;

(e) find Minimum spanning tree using Prim's algorithm

A.14.2-6. Consider the 10-city traveling salesman problem whose links have the associated distances shown in the following table. City 2. 3 4 5 7 00 9 10 13 25 oo 26 15 21 11 21 29 18 10 15 10 35 2 3 4 5 6 600 V WN- 21 23 13 12 19 31 28 19 11 10 18 23 44 34 37 25 32 29 8 16 34 24 27 14 23 10 36 25 35 16 14 8 City 1 is the home city. Starting with each of the initial trial solu- tions listed below, apply the basic tabu search algorithm in your IOR Tutorial to this problem. In each case, count the number of times that the algorithm makes a nonimproving move. Also point out any tabu moves that are made anyway because they result in the best trial solution found so far