Use heapsort to put the numbers 8, 2, 6, 1, 5, 9, 7 in decreasing order. You may use either the tree or the array representation. (i) Explain/show clearly how the initial heap is established.  (ii) Show the heap and the partially sorted list obtained at each stage.

3. Sort the array A= [10, 15, 11, 12, 6, 28, 19] by using the operation (insertion and deletion) of Heapsort.

python   This question is on heapsort. (a) We aim to construct a max heap based on an array A. When we call heapify(A,i) for i > size(A)/2, what will happen? (b) Assuming the elements in the array A are in a decreasing order, what is the running time of heapsort on A (using a max heap when constructing the heap)?

U7