Problem 6 Sweet Wheat, Inc. is making the daily cupcake run around the Kansas City metropolitan area. The daily run takes fresh cupcakes from the Sweet Wheat bakery (SW) to each of their customers before returning to the bakery. They have seven customers and have identified the driving distance (in miles) between each pairwise combination as shown in the table. One-way streets and various construction projects affect driving distances such that the distance from one to the other may not be the same depending on which site is the starting point. Identify the route that requires the least travel distance that can be found using the NN heuristic. (Hint: Use each site as the starting point for the NN heuristic to identify all of the loops that the NN heuristic finds. Then select the shortest loop and present it as a route that begins at the Sweet Wheat bakery and visits each customer once before returning to the bakery.) From/To SW Bosco's Champion Damron Enumclaw Luvies Jones Heidi SW 9 7 3 2 4 5 11 Bosco's 7 - 10 3 8 UI Champion 6 8 4 11 8 Damron 3 4 9 6 8 2 13 Enumclaw 2 10 a O OO I O N Luvies 5 10 A I W W Jones 12 Heidi 11 W 8 13