2. [30 Pts] Heap and the Heap Sort: Consider the following array A. A = {24, 47, 56, 5, 84, 34, 48, 89, 23, 78} a) Array

[answerhappygod]

2 30 Pts Heap And The Heap Sort Consider The Following Array A A 24 47 56 5 84 34 48 89 23 78 A Array 1 (86.45 KiB) Viewed 37 times

2. [30 Pts] Heap and the Heap Sort: Consider the following array A. A = {24, 47, 56, 5, 84, 34, 48, 89, 23, 78} a) Array A is not a heap. Clearly explain why does above tree not a heap. b) Using build heap procedure discussed in the class, construct the heap data structure from the array A above. Represent your heap in the array A as well as using a binary tree. Clearly show all the steps c) Show how heap sort work in the heap you have constructed in part (b) above. Clearly show all the step in the heap sort