*Prove that if unions are done by size and path compression is performed, the worst-case running time is O(Mα(M, N)).
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.