Data Structure and Algorithms

4 Min-Heap Consider the array: A 4, 33, 6, 90, 33, 32, 31, 91, 90, 89, 50, 33 ) i. Is A a min-heap? Justify your answer by briefly explaining the min-heap property ii. If A is a min-heap, then extract the minimum value and then rearrange the array with the min-heapify procedure. In doing that, show the array at every iteration of min-heapify. If A is not a min-heap, then rearrange it to satisfy the min-heap property