For the question above please answer from a to e (This is one question).

(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

(c) whose links have the associated distances shown in the follow- A 14.2-7. Consider the 10-city traveling salesman problem non wollo mong ing table. 7 6 8 City 9 10 2 3 4 5 18 13 25 26 2 3 15 21 11 21 29 18 10 Nm non a 9 19 21 1 31 23 28 13 19 12 11 10 8 15 23 16 10 44 34 35 * IT 34 24 29 37 27 36 25 14 25 32 23 35 10 16 14 5 6 . 8 n d. 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 out any tabu moves that are made anyway because they result in (a) Ice ad move. Also point the best trial solution found so far