10 and 12 please

Show the two children produced. 10. Consider the instance of the TSP in Figure 10.12. Apply the Nearest Neighbor Algorithm starting with each of the vertices. Do any of them yield the shortest tour? 11. Form the union graph of the two tours shown in Figure 10.13, and apply the 12. Apply the Greedy Edge Algorithm to the instance of the TSP in Figure Figure 10.12 An instance of TSP Nearest Neighborhood Algorithm to the resultant graph starting at vertex v, 10.12. Does it yield a shortest tour? 71 Sto