3. [15pts] Suppose we have the following parent implementation of a forest representing a partition of a set of 17 elements: i 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Parent[i] 7 -3 8 7 14 0 1 8-13 3 14 4 -1 3 30 1 a. Sketch the trees in E b. Show the state of Parent[0:16) after a call to Union(Parent[0:16),1,8) and sketch the trees in F. c. Given the state of Parent[0:16] in part (b), show the state of Parent[0:16] after an invocation of Find2(Parent[0:16],4) and sketch the trees in F