(Solved): Question 3: Max-heap using priority queues. Implement a Max-heap data structure using an array suc ...

Question 3: Max-heap using priority queues. Implement a Max-heap data structure using an array such that the lowest element (highest priority) stays at the index location 0 (first element in the array). You will need to implement Heapify-up and Heapify-down operations for the heap to operate correctly for addition and deletion of elements. a) Demonstrate addition and deletion of 5 elements to the heap. b) Explain the time complexity of Heapify-up and Heapify-down operations.