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

Question $15$ options:

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

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.

None of the answers are correct

It is desirable for similar objects to produce hash values close to each other. QUESTION $23$ Consider the algorithm that converts infix to postfix that utilize a stack. What does it look when the algorithm got to the $7$th character of the following string $(($A$+$B$)*$C$$D$)*$E$$

Question $23$options:

$-----------------------------------$

Count: $3$

Stack

A

B

$+$

$...$

$...$

$--------------------------------------$

$-----------------------------------$

Count: $2$

Stack

$($

$*$

$...$

$...$

$...$

$------------------------------------$

$-----------------------------------$

Count: $3$

Stack

$($

$($

$+$

$*$

$...$

$-------------------------------------$

$-------------------------------------$

Count: $0$

Stack

$...$

$...$

$...$

$...$

$...$

$-------------------------------------$