Can someone help me with the following question?

Develop a Union-Find implementation that uses the same basic strategy as weighted quick-union but keeps track of tree height and always link the short tree to the taller one. Prove a logarithmic upper bound on the height of the trees for n sites with your algorithm.

public WeightedQuickUnionUF(int N) count N ; for (int i = 0; i