SOLVE STEP BY STEP , DO NOT USE A SOLUTION ALREADY POSTED OR I WILL DISLIKE , I HAVE SEEN ALL SOLUTIONS

Helping Harvest is a food bank in the Greater Miami area that collects food donations from local grocery stores and transports them back to a distribution center for sorting and transfer to local food kitchens that feed people in need. Tight budgets and environmental concerns require that both fuel and driver resources be used sparingly. Thus, Mr. Vivek, Helping Harvest's general manager, would like to ensure that collection vehicles are routed most efficiently. The table provides the driving distance in miles between the depot (the distribution center where the truck begins and ends its route) and the five stores that donate food. Currently, the Helping Harvest truck travels the following route: Depot-Store A-Store B-Store C-Store D-Store E-Depot. Part 1 a. Use the NN heuristics to find a shorter route and calculate the savings in miles traveled per day. b. The manager at Store B would like the Helping Harvest truck to pick up from her store as early as possible. How many miles does the constraint of visiting Store B first add to the route selected in (a)? Part 2 Revisit the Helping Harvest problem in Part 1. Assume that due to truck capacity constraints, not all stores can be visited in one route. Use the NN heuristic to develop two routes: one that picks up from Stores A and B and one that picks up from Stores C, D, and E in two separate trips. How many miles does this capacity constraint add to the truck's daily miles of travel