(Solved) : Hw72 Run Kruskal S Mst Algorithm Algorithm 83 Figure 84 Page 396 Unlike Last Problem Requi Q32478660 . . . .

HW7.2: Run Kruskal’s MST algorithm (Algorithm 8.3) on Figure8.4(a) (Page 396)
Unlike the last problem, you are NOT required to show multiplepictures of
the graph. The only graph you need show is the final spanning tree(so do
not draw the non-tree edges at all). In addition, show how the setgroupings
change with each new added edge. (This will be much like thecaption on
Figure 8.11 (Page 414), except I do NOT require you to list thesingleton sets.
That is, {3}, {4}, and {12} need not be mentioned, and the captioncould
be shortened to:
{1,2,4,7,10,11,17} {6,8,9} {13,14,15,16}
If edge 13-17 were to be chosen next, the next list would be:
{1,2,4,7,10,11,13,14,15,16,17}