Quick please

01. (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), (2,3), (2,5), (3,5), (5,4), (4,d), (6,d) and only created by basic variables. There are not any NBV at Upper Bound in the MST. Distances for the ares are given in the table Hint: All variables (x_13's) E (0,1) where i (h, 1,2,3,4,5,6), ) E (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 0(theta)? - Don't solve for optimall th, 1) th.2) 1h,3) (1.4 (1,5) (2.4 (2,5 (3,5) (3,6) (4.0) (5,4) (5,6) (5,0) (6.0) Distance 614 435 585 408 882 1694 1425 1505 864 628 1007 1028 742 1229