Suppose we have $20$ singleton sets, numbered $0$ through $19,$ and we call the operation

union$($find$($i$),$ fin$(i+5),$ for $i=0,1,2,$dots.$\mathrm{.}14.$ Draw a picture of the tree$-$based representation of the sets

that result, assuming we don't implement the union$-$by$-$size and path compression techniques.

Repeat exercise $(6)$ assuming that$/$we now implement union by size technique $($no path compression

technique$)$