3. [15pts] Suppose we have the following parent implementation of a forest representing a partition of a set of 17 elements: i 012 3 14 0 4 5 6 7 8 18-13 9 10 11 12 13 14 15 16 3 14 4 -13 301 Parent[i] 7-3 87 a. Sketch the trees in F. 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.