2. (IO marks] (This is part of exercise 21.3-5 from the textbook.) For the tree implementation of disjoint sets, with union-by-rank and path compression, prove that any sequence of m makeSet, find, and link operations, where all the link operations appear before any of the find operations, takes only O(m) time