Given a key k in a SortedMap, how can I efficiently find the largest key m that is less than or equal to k, and also the smallest key
k
m
