Problem
1. What is the worst-case running time for inserting n key-value entries into an initially empty map M that is implemented with a list?
2. Describe how to use a map to implement the dictionary ADT, assuming that the user does not attempt to insert entries with the same key.