sorted maps the traditional map adt allows user to look up the value associated with given keybut the search for that key is form known as an exact search for examplecomputer systems often maintain information about events that have occurred (such as financial transactions)organizing such events based upon what are known as time stamps if we can assume that time stamps are unique for particular systemthen we might organize map with time stamp serving as the keyand record about the event that occurred at that time as the value particular time stamp could serve as reference id for an eventin which case we can quickly retrieve information about that event from the map howeverthe map adt does not provide any way to get list of all events ordered by the time at which they occuror to search for which event occurred closest to particular time in factthe fast performance of hash-based implementations of the map adt relies on the intentionally scattering of keys that may seem very "nearto each other in the original domainso that they are more uniformly distributed in hash table in this sectionwe introduce an extension known as the sorted map adt that includes all behaviors of the standard mapplus the followingm find min)return the (key,valuepair with minimum key (or noneif map is emptym find max)return the (key,valuepair with maximum key (or noneif map is emptym find lt( )return the (key,valuepair with the greatest key that is strictly less than (or noneif no such item existsm find le( )return the (key,valuepair with the greatest key that is less than or equal to (or noneif no such item existsm find gt( )return the (key,valuepair with the least key that is strictly greater than (or noneif no such item existsm find ge( )return the (key,valuepair with the least key that is greater than or equal to (or noneif no such itemm find range(startstop)iterate all (key,valuepairs with start <key stop if start is noneiteration begins with minimum keyif stop is noneiteration concludes with maximum key iter( )iterate all keys of the map according to their natural orderfrom smallest to largest reversed( )iterate all keys of the map in reverse orderin pythonthis is implemented with the reversed method