please help me with this problem in c++

Spanning tree of a connected graph G is a connected acyclic subgraph of G that includes all of G’s vertices. Minimum spanning tree of a weighted, connected graph G is a spanning tree of G of minimum total weight. Write programs to find out the MST for a given graph. (Use both Prim’s and Kruskal’s algorithms) Use the following graph as the test case. a5b Show transcribed image text Spanning tree of a connected graph G is a connected acyclic subgraph of G that includes all of G’s vertices. Minimum spanning tree of a weighted, connected graph G is a spanning tree of G of minimum total weight. Write programs to find out the MST for a given graph. (Use both Prim’s and Kruskal’s algorithms) Use the following graph as the test case. a5b

## Expert Answer

Answer to Spanning tree of a connected graph G is a connected acyclic subgraph of G that includes all of G’s vertices. Minimum spa…