Design a HashMap without using any built-in hash maps/hash sets classes Implement the MyHashMap Class: MyHashMap()...

Transcribed Image Text:

Design a HashMap without using any built-in hash maps/hash sets classes Implement the MyHashMap Class: MyHashMap() initializes the object with an empty map. void put (int key, int value) inserts a (key, value) pair into the HashMap. If the key already exists in the map, update the corresponding value. int get(int key) returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key. void remove(key) removes the key and its corresponding value if the map contains the mapping for the key. Whatever option you decide to use to implement MyHashMap discuss why you picked this option. Discuss the complexity of the methods: put, get, and remove. Design a HashMap without using any built-in hash maps/hash sets classes Implement the MyHashMap Class: MyHashMap() initializes the object with an empty map. void put (int key, int value) inserts a (key, value) pair into the HashMap. If the key already exists in the map, update the corresponding value. int get(int key) returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key. void remove(key) removes the key and its corresponding value if the map contains the mapping for the key. Whatever option you decide to use to implement MyHashMap discuss why you picked this option. Discuss the complexity of the methods: put, get, and remove.