Consider a sorted map that is implemented by means of a standard Binary Search Tree T. Give an algorithm (in pseudo-code) to perform the operation removeSubMap(k1, k2) that removes all entries whose keys fall within [k1,k2] , in worst-case time O(s+h), where s is the number of entries removed and h is the height of T. Analyze and prove the claimed time complexity.