Consider the candidate node selected in part $($c$)$ and continue to apply the Minimum Cost of Insertion Technique and stop at the end of first iteration. What is the total distance decrease from the current vehicle routing in part $($a$)$ to the new vehicle routing obtained at the end of first iteration?Hint: $4,-$ C$,+$C$,$x $-$C$,,$ for all i and $/$: $1*$ JShow your solution work in the provided empty space below and mark only one choice that you think is correct.