Fill the following array in a heap and answer on the following questions: A = [ 12, 15, 17, 8, 9, 33, 24, 6, 21, 12, 10, 5, 14, 7] 1. Apply heapify (A, 2) 2. On the original heap ( before heapify)...

Please help me

Extracted text: Fill the following array in a heap and answer on the following questions: A = [ 12, 15, 17, 8, 9, 33, 24, 6, 21, 12, 10, 5, 14, 7] 1. Apply heapify (A, 2) 2. On the original heap ( before heapify) apply build heap bottom- up approach 3. Then , apply heapsort to sort the have the final array sorted in increased manner