Design an in-memory key-value store using maps

Design the core of a small embedded key-value storage engine. During the design, your in-memory indexing must be built only from associative containers such as maps or dictionaries; primitive scalar values and arrays may be used as auxiliary storage if necessary. Expose these operations: put(key, value) inserts a new entry or replaces the existing value for key. get(key) returns the value associated with key, or null when the key is not present. delete(key) removes the entry…