The number of edges in a Minimum Spanning Tree of a network with $n$ nodes is Execute Kruskal's algorithm and fill in the blanks in order the edges are added $(12$p$).$ Draw. $($Sp$)$ min, spanning tree on the figure by highlight the edges included $(3$p$)$ Identify the representative node of a disjoint set by underlining it$.($otherwise $-5$p$)($MST$)$ or not.

$\backslash$table$[[$Edge$,$Cost,Disjoint sets,$\backslash$table$[[$MST$],[(,)$