urgent

20%) Answer the questions using the following graph. 8 co 25 B 14 15 17 9 E 21 F 12 20 6 5 5 H 10 (a) Draw the sequence of edges (represented by edge weight) added to the minimal-cost spanning tree generated by the Kruskal's algorithm. (b) Do the same thing as (a) using Prim's algorithm. (c) Do the same thing as (a) using Sollin's algorithm. (d) Find the shortest paths from C to all other vertices using Dijkstra's algorithm