Question & Answer: Request solve the undermentioned problem on Alogrithms…..

Suppose the CONNECTED-COMPONENTS is run on the undirected graph G = (V, E), where V = {1, 2, 3, 4, 5, 6, 7, 8, 9} and the edges in E(V) = {e_1 = (1, 3), e_2 = (2, 4), e_3 = (3, 6), e_4 = (7, 8), e_5 = (2.5), e_6 = (3.9), e_7 = (4, 7), e_8 = (3, 8)} are processed in the order {e_1, e_2, e_3, e_4, e_5, e_6, e_7, e_8}. List the vertices in each connected component after each iteration of lines 3-5 in the CONNECTED-COMPONENTS.