(This question is from data structures and algorithms in C++)

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),

union(1, 14)

When the unions are:

a. performed arbitrarily,

b. performed by height,

c. performed by size

Then, for each of the trees perform a find with path compression on the deepest node

Please draw neatly, thank you!