Consider the elements 1..10 that will be used in a Disjoint Sets exercise. Using the Weighted Union and Collapsing Find heuristics, apply the following sequence of operations, redrawing all the sets in tree representation after each operation. Remember that Find (i) returns a result but also might change the tree representation.

Note: For consistency, when calling Merge_trees (i,j) from within Union (i,j), if i and j are two trees of equal height, make Parent[i] = j (i.e. attach i under j).

- For i = 1 to 10do {makeset (i)}

- Union (6, 7) - Union (4, 10)

- Union (3, 1) - Union (2, 4)

- Union (1, 5) - Union (8, 2)

- Union (4, 6)

- Union (7, 1)

- Find (8)