\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
A delivery driver needs to visit 4 locations (A, B, C, D) starting and ending at the depot A. The distances (in km) are given by the weighted complete graph below.
Use the Nearest Neighbour Algorithm starting at vertex A to find an upper bound for the optimal tour.
Capture an image of your work. AI teacher feedback takes approximately 10 seconds.