QUESTION #$14$: must visit to minimize his energy costs.

a$.$ Use the Nearest Neighbor heuristic to locate the best route for Big Jim, assuming that he is interested in minimizing Euclidean distances.

First determine Euclidean distances between each location and fill in the table below. $($Enter your responses rounded to one decimal place.$)$

Fill in the table with the results of using Nearest Neighbor heuristic. $($Enter your responses rounded to one decimal place.$)$

The shortest route is

having total distance of

Note that using the same sequence of cities, we can start the route at any one of them and travel the same total distance. $($Enter your response rounded to one decimal place.$)$

b$.$ Use the Nearest Neighbor heuristic to locate the best route for Big Jim, assuming that he is interested in minimizing rectilinear distances.

Specify rectilinear distances between each location and fill in the table below. $($Enter your responses as whole numbers.$)$

Fill in the table with the results of using Nearest Neighbor heuristic. $($Enter your responses as whole numbers.$)$

The shortest route is

having total distance of

Note that using the same sequence of cities we can start the route at any one of them and travel the same total distance. $($Enter your response as a whole number.$)$

$.$ Therefore, the method of measuring

the choice of route.