In open addressing, what does linear probing do when a collision occurs?

In open addressing, what does linear probing do when a collision occurs?

• A. It uses a separate chained list to store colliding keys.
• B. It uses a secondary hash function to rehash and find an empty slot.
• C. It probes the next slot sequentially until an empty one is found.
• D. It resizes the table automatically when collisions occur.

Answer: (C)