Show the result of the following sequence of instructions: union(1,2), union(3,4), union(3,5) uion(1,6), union(3,7), union(8,9), union 1,8) union(3,10), union(3,), 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 Performed by height (always making the shallower tree the child), Performed by size (always making the smaller tree the child) For each of these (final) trees, do a find with path compression on the deepest node, and show the resulting tree