Consider the traveling salesman problem including one depot $($node $1)$ and $9$ customers $($nodes $2..10)$ defined

by the following distance matrix:

Execute a $2-$opt heuristic starting from the sequence $r=(1,2,3,4,5,6,7,8,9,10,1).$ Clearly indicate at

every iteration: i$)$ the move performed; ii$)$ the cost reduction achieved.