n a Hashing algorithm, a collision condition is said to occur if $\_\_\_\_\_\_\_.$

Group of answer choices

there is a finite number of hash values for a given message $($for a given hash function$)$

the hash of two different messages is the same

the hash of a given message is reversable

the hash of a given message is not pseudo random