IV. Consider the following weighted undirected graph and assume that the neighbors of any vertex are always accessed in their respective alphabetical order by label. Draw the minimum-cost spanning tree produced by running the Prim's algorithm on this graph, using vertex a as the source. (5 Marks) V. Explain the terms (5 Marks) a) Connected graph b) Tree c) Spanning tree d) Path e) MST d 2 VI. VII. State the number of edges in a minimum spinning tree of a network with n vertices. (1 Mark) State the number of edges in a minimum spinning tree of a network with 10 vertices. (1 Mark)