its an undirected graph
Apply Prim’s Algorithm to find a minimum-weight spanning tree for the graph shown in Figure 1 below. You must show supporting work and give the total weight of vour spanning tree. Figure 1 2 1 5 5 Show transcribed image text Apply Prim’s Algorithm to find a minimum-weight spanning tree for the graph shown in Figure 1 below. You must show supporting work and give the total weight of vour spanning tree. Figure
OR
OR