Question: For each of the trees in Exercise, perform a find operation with path compression on the deepest node.
Exercise: Show the result of the following sequence of instructions: union (1, 2), union (3, 4), union (3, 5), union (1, 7), union (3, 6), union (8, 9), union (1, 8), union (3, 10), union (3, 11), union (3, 12), union (3, 13), union (14, 15), union (16, 0), union (14, 16), union (1, 3), and union (1, 14) when the union operations are performed
a. Arbitrarily
b. By height
c. By size