Consider the following undirected graph: 4 9 4 1 3 8 2 0 1 3.1 What is the sequence of vertices added to the MST for the above graph when running Prim's algorithm, starting from node 7? a) 7,2,0,5,1,3,4,6 b) 7,2,0,5,3,1,6,4 c) 7,2,0,3,5,1,6,4 d) 7,2,5,4,0,1,3,6 e) 7,2,5,4,0,3,1,6 3.2 What is the sequence of edges added to the MST for the above graph when running Kruskal's algorithm? Use the edges' weights as their label for this purpose. a) 1,4,9,2,3,5,7 b) 1,2,4,5,3,9,7 C) 1,2,4,3,5,7,9 d) 1,2,3,4,5,7,9 e) 1,2,3,4,5,6,7,8,9