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.) Draw the forest that results from executing the following operations on the forest above: UNION(0,2), MAKESET(3), MAKESET(7), UNION(3, 7), MAKESET(5), UNION(5, 3), MAKESET(8), UNION (1,8),UNION(0,8),UNION(8,3). If you wish, instead of drawing the structure, you can use a text representation such as the one in Fig. 4