For the following elements, please complete the following (Use java language if needed):

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: 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: 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: 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