Question 5-1. In class, we discussed the problem difficulties. For example, Shortest Path (SP) or Minimum Spanning Tree (MST) problems are easier than Traveling Salesman Problem (TSP) or Vehicle Routing Problem (VRP). So, we are planning to design the solution approach of TSP problem using the solution to the MST problem. Consider the following network and the procedure. If there is no edge between two points (e.g., A and D do not share any edge), the distance between those nodes is infinite. 3 Step 0. Prepare the network model. Step 1. Construct the Minimum Spanning Tree. Step 2. Let the root be an arbitrary node. In this case, it is node A. Step 3. Traverse all the nodes. In this example, the sequence is A-B-C-D-C-E-C-B-A. Step 4. 2 Step Step 1. D B A) Can you complete Step 4 to develop the tour (solution to the TSP problem?) E A Step 2 Step 3. E