Let T be a heap storing n keys. Give an efficient algorithm for reporting all the keys in T that are smaller than or equal to a given query key x (which is not necessarily in T). The keys do not need to be reported in sorted order. Let your algorithm run in O(k) time, where k is the number of keys reported. Using a min-heap or a max-heap is your decision in designing the algorithm. Give the algorithm in pseudocode. Justify that your algorithm runs in O(k).