Please read the question carefully before giving your answer. Q2. (50 pts) Given the network representation below, you are trying to find the shortest distance between your home (node h) to destination (node d). The minimum spanning tree for the network is given as arcs (h, 1), (h,3), (2,5), (3,5), (5,4), (4,0), (6,d) and only created by basic variables. Distances for the arcs are given in the table. Hint: All variables (x_ij's) e {0,1} where i e {h, 1,2,3,4,5,6), je {1,2,3,4,5,6,d} a) Draw the minimum spanning tree (MST). b) Use network simplex algorithm to determine whether the solution that you obtained in Mst is optimal? If not, what are the entering and leaving variables and the value of (theta)? - Don't solve for optimal! (1,1) (1,2) (1,3) (1,4) (1,5) (2,4) (2,5) (3,5) (3,6) (4,d) (5,4) (5,6) (5,d) (6,d) Distance 1459 1254 1753 1099 734 1057 1564 1483 1062 734 737 701 662 537