What is collision resolution in a hash table?

A a$.$ The process of handling two or more keys that hash to the same index

b$.$ The process of resizing the hash table when it becomes full

c$.$ The process of mapping keys to unique indices

d$.$ The process of inserting elements into the hash table