Question $1$ GreenTable, located in Cambridge, Massachusetts, sells and delivers compostable tableware, including straws, cups, and utensils to local coffee owners who place bulk orders. Bulk orders delivery service is expensive, and Sara Allen the founder and owner of GreenTable, is looking for cost$-$saving opportunities. Since you recently completed SC$0$x$,$ she asked you to analyze GreenTable's vehicle routing options and shared the information in Tables $1$ and $2.$ Table $1.$ Distance $($in km$)$ between GreenTable and each customer Customer #$1$ Customer #$2$ Customer #$3$ Customer #$4$ Customer #$5$ GreenTable Customer #$1403053973$ Customer #$21988460$ Customer #$371222$ Customer #$433101$ Customer #$545$ Table $2.$ Demand in boxes per customer Customer ID Customer #$1$ Customer #$2$ Customer #$3$ Customer #$4$ Customer #$5$ Demand $($in boxes$)6034144286$ Your initial assumption is that GreenTable has a large enough truck to deliver all orders in one tour. Thus, you decide to use the nearest neighbor technique to find the shortest route $($in km$)$ starting from GreenTable, visiting all customers, and returning to GreenTable. What would be the total distance traveled by the truck in this case? Question $2$ After you share your results with Sara Allen, she tells you that your initial assumption is wrong. Deliveries are made in the city, so it is impossible to use a large truck. Up to now, GreenTable has been delivering just one order per tour $($from GreenTable to customer and back$)$ with a delivery van that they own. You decide to apply the Clark$-$Wright savings algorithm to calculate the potential distance savings of pairing customers. What is the greatest distance savings $($in km$)$ that GreenTable could get from pairing two customers in one tour? Question $3$ Sara Allen finds the Clark$-$Wright savings algorithm very interesting. And she shares with you an additional piece of information: the maximum capacity of GreenTable's delivery van is $80$ boxes. Considering this new piece of information and using the Clark$-$Wright Savings algorithm, which customer should be included in the same tour with customer #$3?$ Question $4$ Based on the information provided in Question $3,$ what would be the distance savings $($in km$)$ of the tour including customer #$3?$