Two unequal keys select the same bucket. What must a correct hash map do?

Two unequal keys select the same bucket. What must a correct hash map do?

1. Keep both candidates and use key equality to distinguish them.
2. Overwrite the older entry because a bucket can hold only one logical key.
3. Treat the keys as equal because their bucket indices match.
4. Increase the stored hash until it becomes unique.