Question 4 30 pts A bakery makes daily deliveries to four stores from a central kitchen. The distances between the facilities are given below. Fill in the net savings matrix and solve the traveling salesman problem using the Clarke-Wright Algorithm. What are the total miles of the route? Show each step of the algorithm. St-3 Kitchen St-1 St-2 St-3 Distance Matrix St-1 St-2 8 15 0 12 0 9 6 0 St-4 7 13 8 6 Net Saving Matrix (Sy = Col + Coj - Cy) St-2 St-3 St-4 St. 1 St- 2 0 St- 3 0 Nodes Joined Savings Route Instruction: . . For "Nodes Joined" column enter values using this format: smaller store number-larger store number, example: 1-4 For "Route" column enter values using this format (lowercase k): . Example of a route with 2 nodes: k-1-4-k Example of a route with four nodes: k-2-4-3-1-k For routes with unacceptable joints put: X Question 4 30 pts A bakery makes daily deliveries to four stores from a central kitchen. The distances between the facilities are given below. Fill in the net savings matrix and solve the traveling salesman problem using the Clarke-Wright Algorithm. What are the total miles of the route? Show each step of the algorithm. St-3 Kitchen St-1 St-2 St-3 Distance Matrix St-1 St-2 8 15 0 12 0 9 6 0 St-4 7 13 8 6 Net Saving Matrix (Sy = Col + Coj - Cy) St-2 St-3 St-4 St. 1 St- 2 0 St- 3 0 Nodes Joined Savings Route Instruction: . . For "Nodes Joined" column enter values using this format: smaller store number-larger store number, example: 1-4 For "Route" column enter values using this format (lowercase k): . Example of a route with 2 nodes: k-1-4-k Example of a route with four nodes: k-2-4-3-1-k For routes with unacceptable joints put: X