9) (20pts) MST (minimum spanning tree) a) (Spts + 3pts+2pts) List the order of nodes that you add onto the MST of the tollowing graph using Kruskal's algorithm. What data structures do we need for this algorithm? What is the running time of this algorithm 15 14 16 18 17 19 10 12 (5pts +3pts+2pts) List the order of nodes that you add onto the MST of the same graph above using Prim's algorithm, starting from node F. What da- ta structures do we need for this algorithm? What is the running time of this algorithm? b)