3. Let T be a heap storing n keys. Give the pseudocode for an efficient algorithm for printing all the keys in T that are smaller than or equal to a given query key x (which is not necessarily in T). You can assume the existence of a O(1)-time print(key) function. For example, given the heap of Figure 2.41 and query key x = 7, the algorithm should report 4,5,6,7.

Note that the keys do not need to be reported in sorted order. Your algorithm should run in O(k) time, where k is the number of keys reported.

15 9 7 20 Figure 2.41: Example of a heap storing 13 integer keys. The last node is the one storing key 8, and external nodes are empty