CSC 220 Data Structures Homework #5 Heaps Due: Wednesday January 30th (beginning of class) Name: 1. (3pts) Does the following array properly represent a max heap? If not, circle the key (or keys) that v the max heap property. 2. (3pts) Show the binary tree representation of the following heap, shown as an array: 3 8 5 9 13 7 611 10 3. (1 pt) ls the heap in question 2 a min heap or a max heap? 8 pts) Show the resulting max heap (as both a binary tree and an array) after each operation: a. insert(5) 4. ( b. insert(9) c. insert(8) d. insert(12) e. insert(2) f. extractMax() g extractMax) h. extractMax)