put( ,vput( ,vremove(kremove(kkeys(keyset(values(values(entries(entryset( simple list-based map implementation simple way of implementing map is to store its entries in list simplemented as doubly linked list performing the fundamental methodsget( )put(kv)and remove( )involves simple scans down looking for an entry with key we give pseudo-code for performing these methods on map in code fragment this list-based map implementation is simplebut it is only efficient for very small maps every one of the fundamental methods takes (ntime on map with entriesbecause each method involves searching through the entire list in the worst case thuswe would like something faster code fragment algorithms for the fundamental map methods with list