8 00 25 B 14 15 17 9 E F 21 12 20 6 5 K H 10 (a) Draw the sequence of edges (represented by edge weight) added to the minimal-cost spanning tree generated by the Kruskals 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