Consider a vehicle routing problem (VRP) instance with 10 customer locations and a single depot. Customer and depot coordinates are presented in the table below. Vehicles have capacity of 100. 10 9 (5 8 6 (2) 7 AWN 1 x woon mm 6 Coordinates Demand Node Y q 0(depot) 5 5 1 8 6 10 2 6 7 40 3 6 9 40 4 7 9 30 5 3 8 80 6 1 7 20 7 3 5 35 8 1 2 30 9 3 3 25 Vehicle capacity Q = 100 7 0 0 5 4 9 0 00 Nm 3 8 2 1 0 1 2 3 4 5 6 7 8 9 10 9 The company is using sweep heuristic to determine how to allocate customers to trucks. Using the data given and the orange ray and counterclockwise direction, determine the set of customers that should be visited by each truck. Consider a vehicle routing problem (VRP) instance with 10 customer locations and a single depot. Customer and depot coordinates are presented in the table below. Vehicles have capacity of 100. 10 9 (5 8 6 (2) 7 AWN 1 x woon mm 6 Coordinates Demand Node Y q 0(depot) 5 5 1 8 6 10 2 6 7 40 3 6 9 40 4 7 9 30 5 3 8 80 6 1 7 20 7 3 5 35 8 1 2 30 9 3 3 25 Vehicle capacity Q = 100 7 0 0 5 4 9 0 00 Nm 3 8 2 1 0 1 2 3 4 5 6 7 8 9 10 9 The company is using sweep heuristic to determine how to allocate customers to trucks. Using the data given and the orange ray and counterclockwise direction, determine the set of customers that should be visited by each truck