The following trees represent five sets: Consider the following sequence of union-find operations on these sets with UNION BY HEIGHT but NO path compression: UnionByHeight (x_2, x_5); Findset (x_1); Findset (x_11); UnionByHeight (x_9, x_6); UnionByHeight (x_4, x_6); Findset (x_4); FindSet (x_9): (a) What element is returned by each of the Findset operations listed above? (b) Draw the trees representing the final data structure