You are assigned the edge weight matrix for a complete graph. Determine an approximation to the minimum weight tour using the (i) Nearest neighbor heuristic (ii) Twice around the tree heuristic. Also, show one attempt of reducing the tour weight using the 2-change heuristic for the tour obtained with each of the two heuristics. Show all the work as well as clearly indicate the tour and its weight before and after the attempt of using the 2-change heuristic in each case.

V1 V2 V3 V4 V5 V6 V10862914 V28041459 V364051510 V595151203 3 0 6 490030 VIII 5 955203 11 245020 111 3 640550 11 /2 804459 /1 086294 1 V2 3 4 5 6