Give a sequence of m MakeSet, Union, and FindSet operations, nof which are MakeSet operations, that takes time Omega(mlog n)when union-by-rank is used, but not path compression, using thedisjoint-set-forest representation.
Expert Answer
An answer will be send to you shortly. . . . .