Consider the following trees, which are a part of a disjoint set:

For these problems, use both the union$-$by$-$size and path compression

optimizations.

$($i$)$ Draw the resulting tree$($s$)$ after calling findSet$(8)$ on the above. What value

does the method return?

$($ii$)$ Draw the final result of calling union $(0,10)$ on the result of part $($i$).$