For the following problems, use this tree: a) Represent this tree using a single array. This array should contain each element from the above tree, and it should be possible to reach descendants in the tree using a function you must provide. You may insert O's if you feel it is necessary Function for finding the left descendant of a given node: Function for finding the right descendant of a given node: The array: b) Repeat the previous problem, only now you must assume that this is a ternary tree (even in spite of no node containing three descendants) Function for finding the first descendant of a given node: Function for finding the second descendant of a given node: Function for finding the third descendant of a given node: The array: 2) Show the resulting AVL tree after adding the following elements. You may assume the tree is empty at the start. If a rotation is necessary, depict the tree prior to that rotation (circle the tree once it has been rebalanced): 96,45,35,85,52,49,5,98,92,43