when a collision occurs during the insertion of an entry to a hash table, finds the next available location sequentially. a. quadratic probing b. double hashing c. linear probing