Can you please provide me with a C++ code and output according to this algorithm and graph.

Prim's Algorithm: Prim's algorithm works differently from Kruskal 's. It builds a minimum spanning tree T by expanding outward in connected links from some vertex. One edge and one vertex are added at each stage. The edge added is the one of least weight that connects the vertices already in T with those not in T, and the vertex is the endpoint of this edge that is not already in T. This algorithm involves the following steps. (i) Choose any vertex v1 of G. (ii) Choose an edge e1=v1v2 of G such that v26=v1 and e1 has the smallest weight among the edges of G incident with v1. (iii) If edges e1,e2,,ei have been chosen involving end points v1,v2,,vi+1, choose an edge ei+1=vjvk with vj{v1,,vi+1} and vk{/v1,,vi+1} such that ei+1 has the smallest weight among the edges of G with precisely one end in {v1,,vi+1}. (iv) Stop after n1 edges have been chosen. Otherwise, repeat Step-3. A step by step illustration of Prim's Algorithm to find a minimal spanning tree of the graph given Example 11.3 (Figure 12) is given below