A sales director who lives in city A is required to fly to regional offices in cities B, C, D, and E. The weighted graph shows the one-way airfares between any two cities. Use the Nearest Neighbor...

Extracted text: A sales director who lives in city A is required to fly to regional offices in cities B, C, D, and E. The weighted graph shows the one-way airfares between any two cities. Use the Nearest Neighbor Method, with starting vertex A, to find an approximate solution. What is the total cost for this Hamilton circuit? 247 158 271 E 120 •B 259 493 276 251 232 224 ..... BADE c Drag each of the vertices given above into the area below to determine the optimal solution. *****