Irene, who is taking the MicroMasters in Supply Chain Management courses, started to imagine different scenarios. Now she wants to apply the Clark-Wright savings algorithm method to optimize the delivery process. Considering the distance matrix, if Ann calculates and sorts the distance savings for every pair of markets, what are the 3 highest (top 3) values of savings (in miles)? Do not use any optimization process beyond the Clark-Wright method. Note that the van has no capacity constraint. Input your answer in the following boxes in order:. 1st highest savings. ,2nd highest savings, 3rd highest savings