This graph shows the roads between towns, and the length of each road in kilometres. В 150 A delivery driver lives in town D, and must visit every other town before returning to D. 110 a Complete the graph with edges showing the least distance between each pair of towns. 25 200 b Use the nearest neighbour algorithm starting at D to find an upper bound for the TSP. C The delivery van can travel 600 km on one tank of fuel. By applying the deleted vertex algorithm with vertex A 80 E 100 deleted show that the driver must refuel during the trip

A B с D E F A 40 B 40 : с 9 30 DE F -- 9 30 19 5 6 35 31 50 44 8 18 42 23 T 19 35 8 5 31 18 6 50 42 44 23 29 29 The weights of edges in a graph are shown in the table above. Apply the sorted edges algorithm to the graph. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA

15 10- B 5 D Apply the sorted edges algorithm to the graph above. Find the total cost of the resulting circuit.

ment 7 Protected View Saved to this PC A Johl References Mailings Review View Help nternet can contain viruses. Unless you need to edit, it's safer to stay in Protected View. Enable Editing rd have been disabled, Reactivate 22. Apply the Sorted Edges algorithm. Answer by drawing the edges you use to create the circuit on the empty vetices on the right OR list the edges that you use to create the circuit on the line next to #22. 12 но E 13 10 6. 11 4 23. What is the weight of the circuit you found in #22? hp