3. Consider the network that is represented by the following direct distance matrix. All edges are bidirec- tional and the distances in both directions are the same. There is a depot at node 0 with infinite supply and we have identical vehicles to distribute goods to customers at nodes 1 to 10. Each customer must be visited by exactly one vehicle. Our objective is to determine vehicle routes such that total traversed distance is minimized. Cijo 0 1 2 3 1 2 3 4 5 6 7 8 9 10 47 59 49 30 81 53 53 72 83 42 39 90 37 63 52 42 76 108 65 80 | 29 | 25 | 20 9 41 80 45 54 92 63 71 64 47 37 50 24 20 47 71 26 32 28 34 78 55 12 24 60 26 34 72 35 44 32 44 |9| 4 5 6 7 8 9 10 (a) Suppose we have p = 3 vehicles and we must exactly create three distinct routes to visit these customers. Use Clarke & Wright heuristic to determine a suboptimal solution for this vehicle routing problem. List your routes and the total traversed distance. (b) Suppose now you can use any number of vehicles, however, a vehicle can visit at most three customers on its route. Use Clarke & Wright heuristic to determine a suboptimal solution for this vehicle routing problem. List your routes and the total traversed distance