\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
A politician is campaigning and needs to visit 5 towns: \(A, B, C, D, E\). The travel times (in minutes) are given in the weighted graph below. The politician starts at town \(A\) and must visit every town exactly once before returning to \(A\).
Use the Nearest Neighbour Algorithm starting at vertex \(A\) to find an upper bound for the travel time.
Capture an image of your work. AI teacher feedback takes approximately 10 seconds.