WILL GIVE THUMBS UP, dont forget drop down for basic chart

59.im plows soow for five residential customers in northern New Hampshire Placing a Cartesian coordinate system on a map of his service area with his home at the origin (AB9 Jim located his Ive customers at coordinates: 3.16), C 93) D (12,28 E (17.45 F2132) He has two ways to measure distances between his customers Eddian and reclinar (See Chapter , Process Strategy and the section on tayouts for the definitions of these more. He wondering this method of measuring distances willecta sence of customer locations be must visit to minimize his energy costs Use the Nearest Neighbor heuristic to locate the best route for Big Jim, assuming that he is sted in minimizing Euclidean distances First delarmine Euclidem distances between each location and in the table below (Enter your responses founded to one decimal place) A D E A 0 F OCE C 0 E F idential Fan the table with the results of using Nearest Neighbor heuriste (Enter your responses rounded to one omal place) Starting location Route A w Total distance 100000 *** D MW 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 Spocity rectilinear distances between each location and fill in the table below (Enter your responses as whole numbers) B E F ODDI B I DOC. TOIDO D E F Fill in the table with the results of using Nearest Neighbor heuristic (Enter your responses as whole numbers) Route Total distance Starting location A B BOLOD D E B C D E F Nors Enter your whole number Starting location Route A V D The who www dare elevators the same as we can wrthwyn enw power The mean of