mapshash tablesand skip lists class sortedtablemap(mapbase) """map implementation using sorted table "" nonpublic behaviors def find index(selfklowhigh) """return index of the leftmost item with key greater than or equal to return high if no such item qualifies that isj will be returned such that all items of slice table[low:jhave key all items of slice table[ :high+ have key > "" if high low return high no element qualifies else mid (low high/ if =self table[midkey return mid found exact match elif self table[midkeynotemay return mid return self find index(klowmid else return self find index(kmid highanswer is right of mid public behaviors def init (self) """create an empty map "" self table def len (self) """return number of items in the map "" return len(self table def getitem (selfk) """return value associated with key (raise keyerror if not found"" self find index( len(self table if =len(self tableor self table[jkey ! raise keyerrorkey errorrepr( ) return self table[jvalue code fragment an implementation of sortedtablemap class (continued in code fragments and