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. Distance Matrix St-1 St-2 St-3 St-4 Kitchen 8 15 8 7 St-1 0 12 9 13 St-2 0 St-3 60 8 6 Net Saving Matrix (Sij = Coi + Coj - Cij ) St- 11 St-2 7 1 St- 0 10 2 St- 3 St-3 2 14 0 9 St-4