Which of the following claims is true about hash functions and hash values?

Question $2$ options:

It is desirable for similar objects to produce hash values close to each other.

Hash functions that use the division method should avoid using prime numbers because it causes primary clustering.

A hash function should incorporate randomness to prevent clustering.

If two hash values are equal, the objects that produced them are also equals.

None of the answers are correct