Which Statement About Handling Collisions in a Hash Table Using

Multiple Choice

Which statement about handling collisions in a hash table using the open addressing technique is correct?

A) A colliding element will always be contiguous to the location in which it would normally be placed.
B) To find an element, you must search from the hash code location until a match or an element with a different hash code is found.
C) To remove an element, you simply empty the slot at which you find it.
D) There may be some elements with different hash codes that lie on the same probing sequence.