DATA STRUCTURE CASE STUDY 4

What is hash collision?a collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest.
What really happens during a hash collision? Include an image
What are the ways and methods to resolve hash collision? Explain Each
a hash table or hash map is a data structure that uses a hash function to map identifying values, known as keys to their associated values  their telephone number.
EXPLAINITION: because collision are hash function should map each possible key to a unique slot index, but this ideal is rarely achievable in practice  Instead, most hash table designs assume that hash collisions is different keys that map to the same hash value will occur and must be accommodated in some way.