C-3.3 Design an algorithm for performing the operation findAllElements(k) in an or- dered dictionary implemented with a binary search tree T, and show that it runs in time O(h+s), where h is the height of T and s is the number of items returned