This problem is about the array-based binary heap implementation of a priority queue. let h denote the backing array, i. e h is a binary min-heap array. you should assume that the universe of possible keys is extremely large relative to the size of the heap (i. e., it is not practical to use a position array as described on p. 65 of the ) give an algorithm for a new operation decreasekey(index, delta) that subtracts delta from the key located at the given index in h, and restores the heap ordering. report the time taken by the algorithm.(b) suppose we also want an operation findkey(v) that returns the index of a key k in h (if k appears more than once, then it does not matter which index is returned). describe a modified implementation of the heap in which your findkey(v) operation is o(1), finding the minimum is still o(1), and the operations to insert a key or remove the minimum are still o(log n).