Write $C++$ code of this algorithm

Prim's Algorithm: Prim's algorithm works differently from Kruskal $\text{'}$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 $v_1$ of $G.$

$($ii$)$ Choose an edge $e_1=v_1{v}_2$ of $G$ such that $v_2=v_1$ and $e_1$ has the smallest weight among

the edges of $G$ incident with $v_1.$

$($iii$)$ If edges $e_1,e_2,$dots,$e_i$ have been chosen involving end points $v_1,v_2,$dots,$v_{i+1},$ choose an edge

$e_{i+1}=v_j{v}_k$ with $v_{j}in\{v_1,$dots,$v_{i+1}\}$ and $v_{k}in\{\frac{?}{v_1},$dots,$v_{i+1}\}$ such that $e_{i+1}$ has the smallest

$($iv$)$ Stop after $n-1$ 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\mathrm{.}3($Figure $12)$ is given below.

$,$