smaller Save Question 15 (2 points) Given a heap that has 20 integer values in it stored in an array answer the following questions (If a child/parent node doesn't exist, enter -1 for the answer): For the node stored at index 9 of the array, the index where its left child is stored is at index A For the node stored at index 9 of the array, the index where its For the node stored at index 9 of the A A right child is stored is at index array, the index where its parent is stored is at index happens to be the The node at index 9 A (answer left or right) child of its parent. Save Question 16 (2 points) For the following trees, which traversal is guaranteed to print out the nodes in ascending order