Tree-based Sorting. The following is an array representation of an almost complete binary tree where node i’s left child and right child are located at index 2i and 2i 1, respectively. A=[2,31,14,49,84,16,42,63] (a) Draw the binary tree represented by this array. (b)Describe step-by-step how you will use HEAPIFY(i) to turn the tree into a heap (you may need to call HEAPIFY multiple times). (c) Describe how you will use this heap (and its operations) to get the same elements back into an array