In what order were the following numbers inserted into this tree. Assume the following: The tree maintains a sorted order The tree is balanced / minimizes the height When the numbers were inserted, there were no rotations If there could potentially have been 2 numbers inserted at the same time, the smaller one was inserted first. (10 12 (14) (16) (26) Include a single space between each number in your answer. For example 1 2 3 4 5 6 7 8 9 10 Assume the following tree represents a priority queue/heap. Which node is in array spot 5? Assume that the first node is located in spot 0. For your answer, type in the number on the node. For example, if the root is located in spot 5, type in 12 12 36 35 20 40 94 25 32 67 55 36 37