Can somebody please help me in this harsh map need an answer and some exlainations please

Answer 1

Think of them as a dictionary. Hashmaps use a parameterized key and value structure, all keys are unique and can be used to access values in your hashmap, you can then use a hashing function to put values into your hashmap and use the same hashing function to access individual values, best case scenario is a space and time complexity of O(1), constant which in computing terms is the most efficient way to store then manipulate/ access/ and randomly accesses values within your hash map. As a dictionary, your hashing function returns what it synonymous to a page number(key) in you dictionary where you can look for a word then get it's meaning(value)