Answer:
22
Explanation:
The tour length will be the sum of the lengths of its segments. Here, we will figure the length using the greedy algorithm.
__
Starting at B=2, the nearest unvisited city is C=3, a distance of 1.
From C, the nearest unvisited city is A=0, a distance of 3.
From A, the nearest unvisited city is D=10, a distance of 10.
The return trip from D to B is a distance of 8.
The total length of the tour is ...
1 + 3 + 10 + 8 = 22
