Design a variation of algorithm TreeSearch for performing the operation find All(k) in an ordered 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 size of the collection returned.