java algortims

show steps

Union-by-size find() operation - Given a set of elements A-H, perform the following union operations using the union-by-size strategy (i.e. draw the up-trees at each step) What are the results of the following find() invocations? - union(G, D) - find(C) - find(G) - union(C. D) - find(E) - union(E,F) - find(A) - union(B, F) - union(A,H) Show the elements of the array that stores your sets. You can assume - union(G, E) that elements are assigned to indices in sorted order