{{acdef}{ }mst {(ad)(ce)(ef)(ed) {(df)(ac)(ab)(bc)step remove the edge (dffrom note that this edge does not connect different treesso simply discard this edge only an edge connecting (adcefto will be added to the mst {{acdef}{ }mst {(ad)(ce)(ef)(ed) {(ac)(ab)(bc)step remove the edge (acfrom note that this edge does not connect different treesso simply discard this edge only an edge connecting (adcefto will be added to the mst {{acdef}{ }mst {(ad)(ce)(ef)(ed) {(ab)(bc)step remove the edge (abfrom and make the following changesa {abcdefmst {(ad)(ce)(ef)(ed)(ab) {(bc) step the algorithm continues until is empty since the entire forest has become one treeall the remaining edges will simply be discarded the resultant ms can be given as shown below {abcdefmst {(ad)(ce)(ef)(ed)(ab) { programming example write program which finds the cost of minimum spanning tree #include #include #define max int adj[max][max]tree[max][max]nvoid readmatrix(int ijprintf("\ enter the number of nodes in the graph ")scanf("% "& )printf("\ enter the adjacency matrix of the graph")for ( <ni++for ( <nj++scanf("% "&adj[ ][ ])int spanningtree(int src