The following figure shows an example of the operation of HEAPSORT. (a) The max-heap data structure (just after built the max-heap). (b)-(j) The steps HEAPSORT (MAXHEAPIFY), (k) The resulting sorted array A. Note: 1 . only blue nodes remain in the heap. 2. Tan nodes contain the largest values in the array, in sorted order. A (k) Q: Using the above figure as a model, illustrate the operation of HEAPSORT on the array A=5,13,2,25,7,17,20,8,4)