For questions 14-18, refer to the following tree: Question 14 If the abave tree were to be stored as an arrayed tree (as defined in the lectures, which of the following arrays would represent the tree? None of the anays shawn correctly represents the tree. Question 15 Suppose the abave tree is stored as arrayed tree as defined in the lectures. Then suppase the item 99 were inserted into the above tree. Fill in the blanks below: The parent of the node containing 99 would be the node containing the item - (Your answer shauld be an integer.) The sibling of the nade cantaining 99 would be the node containing the item . [Your answer should be an integer except if you think it doesn't have a sibling, in which case enter the ward "nane" without the quates.) Question 16 True or false? The abowe tree is a heap. Whether you think the tree is a heap or not, give one item that is stored in a non-leaf node that violates the heap property. Your answer should be an integer, unless there are no non-leaf nodes that violate the heap property, in which case enter the word "none", without quotes. Question 18 For each node on the left, match it with that node's relationship to the node containing item 34 . The node containing 23 The node containing 22 The node containing 42 The node containing 665 The node containing 14