1) Given the array below representing disjoint sets, draw the associated trees. 121-11-11 31-11-11 6 | 7 | 0 1 2 3 45 6 78 15 points 2) Using trees, perform the following unions, by making the root of the second tree a child of the root of the first tree What do you notice about the resulting tree and what consequence would it have on a find(5)? union(4, 5) union(3, 4) union(2, 3) union (1, 2) union(e, 1)