Heap-Increase key is an operation used in priority queues (a data structure having efficient implementation using heaps). The operation (, , ) takes in the index in the array of a max (or min) heap and increases the index value to . How would you change the pseudo code of to accommodate the changes required to maintain heap property after the increase in the index value

3. Heap-Increase key is an operation used in priority queues (a data structure having efficient implementation using heaps). The operation Heap Increase(A, i, k) takes in the index i in the array of a max (or min) heap and increases the index value to k. How would you change the pseudo code of Max Heapify to accommodate the changes required to maintain heap property after the increase in the index value