0 A dispatcher is working on the truck route for tomorrow's deliveries. Given that he uses the nearest neighborhood search. a. Calculate potential routes (i.e. if there are ties you need to branch through all ties as alternative routes) and the corresponding distances (15 points) Choose the best route that minimizes the distance traveled (5 points) b. D Depot C1 C2 C3 C4 C5 C6 Depot 0 8 12 5 9 8 15 C1 7 0 13 11 8 7 13 C2 4 11 0 6 15 4 14 67726672 C3 12 18 C4 12 16 15 16 8 C5 7 14 3 5 14 0 12 4864448 14 11 0