Questions 10 and 11.

10. Write the function tryReplace(heap_array k,m) that receives a heap array and integers k and 11. Write a function that, given an input array, finds the largest array index i such that all numbers 12. Let's define generation gap as the maximum difference between the value of an element in the and replaces the item at index k by m only if doing so maintains the heap property in heap array from 0 to i in input array form a heap. heap and the value of its parent. Write a method that receives a heap array and returns its generation gap