Given the following heap array, assuming heap entries start at index 1, draw the corresponding binary tree. 1 3 4 7 75 17 68 10 3 32 40

We are to apply Heap Sort on array: 40 63 8 19 5 60 52. What is the content of the array after Step 1 of Heap sort : build the initial heap?   Question 25 options:   40, 60, 63, 19, 5, 8, 52   63, 40, 8, 19, 5, 60, 52   63, 40, 60, 19, 5, 8, 52   40, 63, 8, 19, 5, 60, 52

Subj - Design Algorithm Please show your work clearly and thank you in advance. 1) Draw the heap tree, then apply the HEAPSORT algorithm to sort the array A = [9, 0, 8, 12, 11, 5, 4, 8, 1, 2, 7] in ascending order.(You must perform the HEAPSORT algorithm step-by-step)

1. "Max-beapitx (create a max-heap from) the following array using the bottom-up, O(n), algorithm. Show the final order in the array. Array: 69 2 1 3 45 Array: