Problem
Consider the operations Union and Find from the Union-Find algorithm with path compression. Suppose we have a set of n elements, which has had a series of arbitrary Unions performed on it. Let us denote the result as T. Determine the complexity (expressed in terms of n and m) of a sequence of m Find operations performed on T. For full score, your upper bound should be tight, and the analysis must be done using either the accounting method (credits) or the potential method.