Instructions: solve part B then prepare a table using the nearest neighbor heuristic for paths starting with A$,$ then starting with B$,$ then starting with C$,$ then starting with D$,$ then starting with E$,$ then starting with F$.$ Use part A as an example as A is done correctly.

measuring distances will affect the sequence of customer locations he 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.$)$

$\backslash$table$[[,$A$,$B$,$C$,$D$,$E$,$F$],[$A$,-,21\mathrm{.}9,40\mathrm{.}5,30\mathrm{.}0,51\mathrm{.}5,43\mathrm{.}7],[$B$,,-,22\mathrm{.}8,17\mathrm{.}7,38\mathrm{.}0,34\mathrm{.}0],[$C$,,,-,12\mathrm{.}1,16\mathrm{.}8,17\mathrm{.}8],[$D$,,,,-,21\mathrm{.}8,16\mathrm{.}3],[$E$,,,,,-,10\mathrm{.}3],[$F$,,,,,,-]]$

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

$\backslash$table$[[$Starting location,Route,,Total distance$],[$A$,$A$,$B$,$D$,$C$,$E$,$F$,$A$,122\mathrm{.}5,,,],[$B$,$B$,$D$,$C$,$E$,$F$,$A$,$B$,122\mathrm{.}5,,,],[$C$,$C$,$D$,$F$,$E$,$B$,$A$,$C$,139\mathrm{.}1,,,],[$D$,$D$,$C$,$E$,$F$,$B$,$A$,$D$,125,,,],[$E$,$E$,$F$,$D$,$C$,$B$,$A$,$E$,134\mathrm{.}9,,,],[$F$,$F$,$E$,$C$,$D$,$B$,$A$,$F$,122\mathrm{.}5,,,]]$

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.$)$

$\backslash$table$[[,A,$B$,\frac{?}{\text{b}\text{a}\text{r}}(C),$D$,E,\frac{?}{\text{b}\text{a}\text{r}}(F)$