The shortest path tree rooted at s for Using an appropriate algorithm that we discussed in class, identify the minimum spanning tree on the network and draw the graph. Determine the total cost of the minimum spanning tree. The travel cost matrix is provided for your reference. From\To A A 0 B 18 C 85 D 57 E 84 F 66 B C 18 85 0 71 71 0 53 47 65 57 49 68 D E F 57 84 66 53 65 49 47 57 68 0 89 83 89 0 24 83 24 0the graph depicted below includes the following arcs: {(s,A), (s,B), (A,C), (A,D), (D,t)}. Use this information to answer questions (a) through (d) below. (a) Using the format v(j)[pred(j)], give the minimum cost path label of each node, as specified by the shortest path tree rooted as s described in the problem statement. To get you started, the label at node s is 0[0]. (1.5 points) (b) If the cost on arc (A,C) increases from 3 to 4, what labels must be re-examined to test whether the set of minimum cost path labels is still optimal? Only specify those arcs which must be examined, and justify