To understand how a hash table handles collisions, it helps to first define the problem. 

A hash table uses a **hash function** to map a key (like a name or ID) to an index in an array. The ideal scenario is that every key maps to a unique index. However, because the number of