7. 112 pts totall Disjoint Sets Consider a union-find data structure with union-by-height and pa the tree representation of the considered union-find. These trees numbers '0' to '8' compression. The following figure shows represent a collection of sets containing are indices of this array. The content of the array should represent the sets shown in the figure abovo based on what you learned in the class about implementation of smart union (i.e., union-by-height). (a) [4 pts] Complete the following array that corresponds to the above trees. Note that the numbers '0' to '3 2