Question 1. Suppose you are given the following array, which represents a complete binary tree: Index1 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 12 25 72 49 64 5852 92 819 43 27 98 16 37 336 a. (5 points) Draw the complete binary tree represented by this array b. (10 Points) Is this binary tree a binary heap? If not, build a heap out of this array using the BottomUnHeap we learned in the class. c. (5 points) List the values from the heap as they would be printed out by an inorder traversal of the heap, where the visit0 function prints the value of the current node. d. (5 points) Show the new binary heap that results after the minimum key is removed from the binary heap built at (b)