Below are the distance and savings matrices for a vehicle routing problem. The vehicle has capacity 20 and the customer sizes are: C1=4, C2=3, C3=12, C4=5. Show the FIRST THREE steps of the savings algorithm for assigning customers to routes. You must show your work for full credit by typing it below. You may stop after three steps even if the customers aren't all clustered at that point.