Problem C: Use the quick (approximate) travelling salesperson construction to find a tour for the cost matrix below. You may use either of the methods described. If using the textbook method, start with node A, and clearly state in which order nodes are added to the tour. If using the MST method, stated which edges are part of the MST and then what tour is obtained. Note that the graph is undirected, so only entries above the main diagonal are needed. Node A Node B Node C Node D Node E Node F Node A 6 7 Node B 3 4 Node C 5 Node D Node E 78 2 508801 4 Node F 10 H 10 5 B A 6 1 7 G 11 4 3 F C 8 2 D 9