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) union(G, D) union(C. D) - - - - - union(E, F) union(B, F) union(A. H) union(G. E) A B D find (G) find(E) find(A) E F find() operation What are the results of the following find() invocations? - find(C) G Show the elements of the array that stores your sets. You can assume that elements are assigned to indices in sorted order. H