2. Suppose we have a max heap with n distinct keys that are stored in an array Al1... n] (a max heap is one that stores the largest key at its root). Given a value x, design an algorithm to find the keys in A that are larger than x in O(k) time, where k is the number of keys in A that are larger than x. The algorithm is an output-sensitive algorithm because its time complexity is a function of the size of the output. (20 points)