In the class, we saw that disjoint sets are used to keep trackof the connected components in the Kruskal’s MST algorithm. For thegraph in the following figure, trace the algorithm by showing theconnected components after processing each edge. You do not to drawany graph (just indicate the sets). Initially, the components are{a}, {b}, {c}, {d}, {e}, {f}, which form Line 0 of your answer. Ineach of the following lines, indicate the sets associatedassociated with connected components after processing thesubsequent edge. So, the i`th line of your solution might lookslike: processing edge (x,y) → {u, v}, {w, x, y}, {z}

5
PayPal Gateway not configured
PayPal Gateway not configured