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

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

whose links have the associated distances shown in the follow- A 14.2-7. Consider the 10-city traveling salesman problem mwolle BC, ing table. also 7 8 6 9 10 City 2 3 4 5 s are 13 25 26 15 21 11 pre- 21 29 18 10 3 NM no 9 19 18 21 31 SH 23 23 28 44 2014 13 19 12 11 37 10 25 32 34 8 16 34 24 27 14 23 10 15 10 35 29 36 25 35 16 14 5 6 span- or the ferent E, and blem. 8 9 nimum ne fol- cluded. 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 =C, and move. Also point the best trial solution found so far