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

A) A perfect hash function ensures that every element has the same hash value, resulting in no collisions.
B) Open addressing in hashing handles collisions by using a linked list at each bucket to store multiple elements that hash to the same value.
C) The load factor in hashing represents the ratio of the number of stored elements to the total number of available hash table slots.
D) In separate chaining, when a collision occurs, the hash table is resized to accommodate additional elements, preventing any further collisions.