The graph below shows the distances between cities.

$($a$)$ Use the nearest neighbor algorithm to find a path that starts in Chicago and visits all the cities shown,

while trying to minimize distance traveled.

$($b$)$ What is the total length of the path found in part $($a$)?$

miles

$($c$)$ Find the shortest path between Dallas and New York.

What is the length of this path?

miles

$($d$)$ Find the shortest path between Minneapolis and Atlanta.

What is the length of this path?

miles