Answer:
D.Open Addressing.
Explanation:
It is a technique to handle collision in the hashmap. According to the design of the hash function if the location provided to the element is already full or not empty then the next free location is searched and the key is inserted at that location.So it searches for an unused location in hash table so the answer is Open addressing.
