$($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 E to all other vertices using Dijkstra's algorithm.