Revisit the Helping Harvest problem in Problem 5. 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 C, D, and E in two separate trips. How many miles does this capacity constraint add to the truck's daily miles of travel?