Question $2$

Which of the following is the fundamental idea behind linear probing in open addressing?

$1$ point

Ignoring the collision and overwriting the data

Trying subsequent slots in the array sequentially when a collision occurs

Store duplicate keys in a linked list under each element of the hash table

Doubling the size of the table when a collision occurs