Maps associate values with unique keys. Hashmap is a popular Map implementation that offers typical excellent performance on insertions and retrievals. The following questions concern Map, focusing on its Hashmap implementation. (a) Map specifies a put function (typically put(k, v)), and a get function (typically get(k) returns v). Explain how both these functions are implemented in Hash Map, ensuring you explain how and where items are kept in the underlying storage, along with any key processes. You may include any (Java) language-specific features you consider relevant. (b) One complexity in a Hash Map implementation is that a collision may occur during the processes you have outlined in part (a). Explain what a collision is in this context, how it can be managed, and any impact on the Map. (c) Hash Maps typically perform put and get operations very efficiently. However, this can degrade in certain circumstances. i. Identify and explain the usual time complexity of a hash map for the put/get operations, ii. Explain the cause of performance degradation on these operations iii. Describe how the hash map can have its efficiency restored and what may trigger such a process.