Question $10(1$ point$)$

Ola bakery is a chain of five stores served from a single distribution centre. Deliveries are made by a fleet of two trucks with capacities of $250$ pies per truck. Each truck can

make only one trip per day. The daily demand for each of the stores and the travel distances between the distribution centre $($DC$)$ and the five stores are shown below:

You decided to use the savings method to find the best truck routes to complete all deliveries and minimize the total travel distance for all trucks. A part of the savings matrix you created is as follows:

You know that the first truck will not visit store $5.$ You start the algorithm with linking stores