Please help me answer this question.

Q3 [5 marks] Consider a tree implementation of the union-find ADT using union rank. Assuming that the tree forest is initially empty, Fig. 3 depicts the forest after executing operations MAKESET( 0 ), MAKESET(1), and MAKESET(2) (the value of the set representative is shown inside each node and the set's rank is indicated beside each node. Each set has rank 0 after these three operations.)