Table $1$: Distance matrix

$\backslash$table$[[,0,1,2,3,4,5],[0,0,64,88,48,121,69],[1,41,0,112,82,52,30],[2,57,68,0,63,47,68],[3,47,47,84,0,59,104],[4,90,87,109,55,0,116],[5,104,105,41,36,92,0]]$

Table $2$: Customer demands

$\backslash$table$[[$Customer$,$Demand$],[1,156],[2,130],[3,189],[4,103],[5,181]]$

Problem $3.$ Implement the Clarke$-$Wright Savings heuristic for a VRP with the following data $($Note: distance matrix is asymmetric!$).$ The distance matrix is given in Table $1.$ The demands of the customers are given in Table $2.$

Assume a vehicle capacity of $450.$