Suppose you are given the following array, which represents a complete binary tree: Index 1 2 3 4 5 Key 12 25 10 11 16 17 1637336 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 BottomUpHeap() 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 visit() 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).