Design a variation of binary search for performing find All(k) in an ordered dictionary implemented with an ordered array, and show that it runs in time O(logn+s), where n is the number of elements in the dictionary and s is the size of the iterator returned.