please show all work !!

Q2: 20 pts) You are assigned the edge weight matrix for a complete graph. Determine an approximation to the minimum weight tour using the (i-8) Nearest neighbor heuristic (i-12) Twice around the tree heuristic. Also, show one attempt of reducing the tour weight using the 2-change heuristic for the t with each of the two heuristics. our obtained Show all the work as well as clearly indicate the tour and its weight before and after the att using the 2-change heuristic in each case. empt of Vs 107 12 3 5 V4 15 3 12 O5 V5114 1? Vo lo 8 15 ioO