Prim’s algorithm uses a greedy algorithm to discover the minimum cost spanning tree for a connected weighted undirected graph. …