Minimum Spanning Tree (MST) Consider the following weighted undirected graph with 9 vertices and 14 edges. (a) Complete the sequence of edges in the MST in the order that Kruskal's algorithm includes them (by specifying their edge weights). (b) Complete the sequence of edges in the MST in the order that Prim's algorithm (starting from vertex 0) includes them (by specifying their edge weights)