algorithm please solve it with clear handwrite

2. Tree-based Sorting. The following is an array representation of an almost complete binary tree where node is left child and right child are located at index 2i and 2i +1, respectively. 2016 3052 7312 41 52 (a) (1 point) Does the array shown represent a max-heap? Justify your answer. (b) (4 points) Draw the binary tree represented by this array, (C) (5 points) Describe step-by-step how you will use HEAPIFY() to turn the tree into a heap (you may need to call HEAPIFY multiple times)