Answer the previous exercise assuming that we implement both the union$-$by$-$size and path

compression heuristics. $7[$GT R$-7\mathrm{.}7]$

previous exercise is below..must draw diagram

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

union$($find $(i),$ find $(i+5),$ for $i=0,1,2,$dots,$14.$ Draw a picture of a tree$-$based represen$-$

tation of the sets that result, assuming we don't implement the union$-$by$-$size and path com$-$

pression heuristics.