Prove that if unions are done arbitrarily, but path compression is performed on the finds, then the worst-case running time is Θ(M logN).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.