Question: 21
(Choose 1 answer)
What is linear probing in the context of hash table collision resolution?
A. Storing colliding elements in a linked list.
B. Replacing the colliding element
C. Searching for the next empty slot in the table
D. Doubling the hash table size
