Suppose h(m) is a collision-resistant hash function that maps a message of arbitrary bit length into an n-bit hash value. is it true that, for all messages x, x' with x ≠ x', we have h(x) ≠ h(x')? explain your answer.

That can't be true. Collision resistant just means the chance is really low, but not 0. Suppose you enumerate all possible hash values with each their different original message. Since the message length can be larger than n, you can then find a message whose hash is already in the list, ie., a collision!

one method is to click on the icon.

i think its d if im not mistaken