Design and give the pseudocode for an O(log n) algorithm that determines whether a red-black tree with n keys stores any keys within a certain (closed) interval. That is, the input to the algorithm is a red-black tree T and two keys, l and r, where l r. If T has at least one key k such that l k r, then the algorithm returns true, otherwise it returns false. Hint: You can use the TreeSearch algorithm (page 146) as a subroutine. You cannot use the Breadth-First Search Traversal Algorithm for this one.