Question: Which of the following statements about Hashing in Data Structures is correct?

A) Hashing always guarantees O(1) time complexity for search operations, regardless of the number of elements.
B) A good hash function minimizes collisions, ensuring that different keys map to the same hash value frequently.
C) In open addressing, elements are stored in the linked lists associated with each index of the hash table.
D) Hashing is particularly useful for implementing associative arrays, as it provides a fast way to look up key-value pairs.