Give the state of the disjoint-sets data structure after the following sequence of operations, starting from singleton sets {1}, . . . , {8}.

Use path compression.

In case of ties, always make the lower numbered root point to the higher numbered one.

union(1,2), union(3,4), union(5,6), union(7,8), union(1,4), union(6,7), union(4,5), find(1)

I think after union(4,5) that find(5) does compression and point to 8 directly, right?