Consider a sorted map that is implemented with a standard binary search tree T. Describe how to perform an operation removeSubMap(k₁, k₂) that removes all the entries whose keys fall within subMap(k₁, k₂), in worst-case time O(s+h), where s is the number of entries removed and h is the height of T.