Suppose that CONNECTED-COMPONENTS is run on the undirected graph G = (V, E), where V = 〈a, b, c, d, e, f, g, h, i, j, k〉 and the edges of E are processed in the order (d, i), (f, k), (g, i), (b, g), (a, h), (i, j ), (d, k), (b, j), (d, f ), (g, j), (a, e). List the vertices in each connected component after each iteration of lines 3–5.