Using figures 6.4 and 7.1 as models, illustrate the operations of Heapsort and the Partition procedure as given in lecture on the array . For Heapsort you may omit the steps of Build_Max_Heap and draw the heap right after Build_Max_Heap is executed on the input array as the 1^st step of your solution. For Partition, assume that the last element of the array is selected as the pivot element. Indicate values of i and j after each iteration of the main loop.

Thank you for your help!

(a) (e) Ch) A II 2 3 4 7 l 8 l 9 10 14 16] Figure 6.4 The operation of HEAPsORT. (a) The max-heap data structure just after it has been built by BUILD-MAX-HEAP- ab-oj The max heap just after each call of MAX-HEAPIFY in line 5. The value of at that time is shown. Only lightly shaded nodes remain in the heap. Ck)The resulting sorted array A