For the following graph: (a) Apply Prim's Algorithm, beginning at vertex A. Show the results of each stage of the algorithm. In this case, we define a stage as the addition of a new vertex and a new edge to the MST S -(V,E!. Present the results in the format of the following table (values provided are only ex- amples and do not correspond to the solution) Stage (A,B) (b) Apply Kruskal's Algorithm. Show the results of each stage of the algorithm. In this case, we define a stage as the processing of an edge from the graph, whether or not it is added to the MST S=(V,E). Present the results in the format of the following table (values provided are only ex- amples and do not correspond to the solution) Stage Edges Components Note the division of the MST Vertices Set into Connected Components