What is the best definition of a collision in a hash table?

(A) Two entries are identical except for their keys
(B) Two entries with different data have the exact same key
(C) Two entries with different keys have the same exact hash value
(D) Two entries with the exact same key have different hash values