Data Structure and Algorithms

3 Max -Heap Consider the array A [29, 18, 10, 15, 20, 9, 5, 13, 2, 4, 15) i. Does A satisfy the max-heap property? If not, fix it by swapping elements ii. Using array A (possibly corrected), illustrate the execution of the heap- extract-max algorithm, which extracts the max element and then rear- ranges the array to satisfy the max-heap property. For each iteration or recursion of the algorithm, write the content of the array A