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),(h,3), (2,5), (3,5), (5,4), (4,0), (6,d) and only created by basic variables. There are not any NBV at Upper Bound in the MST. Distances for the arcs are given in the table. Hint: All variables (x_13'3) 10,1) where is th, 1,2,3,4,5,6), DE 11,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 optimalt 0,1) 1,2 ,3) (14) (15) (2.4G 2,5) (0,5) (3,6 14,d (5,40 15,6) (5,0 (6,0) Distance 941 1625 531 1021 507 1459 902 585 1240 652 451 620 462 1448