Using a union$-$find datastructure, you want to find the equivalence classes of the finest equivalence

relation over objects $0,$dots,$9$ which contains the following equivalences:

$23,26,18,75,84,37$

To this end you call union$($v$,$ w$)$ on your datastructure for each $vw$ in the given order.

Specify the forest of trees represented by parent after each call to union$($u$,$v$)$ when using the

datastructure

$($a$)$ Quickunion

$($b$)$ RankedQuickUnion