8. [3 points] Finding an item in a hash table (using quadratic probing) usually takes constant time, but its worst-case run time is O(n). Briefly describe a scenario that would lead to a linear running time for a search in a hash table.

9. [3 points] List the three requirements of a hash function. For each requirement, briefly describe why it is necessary

8. [3 points] Finding an item in a hash table (using quadratic probing) usually takes constant time, but its worst-case run time is O(n). Briefly describe a scenario that would lead to a linear running time for a search in a hash table. 9. 13 points] List the three requirements of a hash function. For each requirement, briefly describe why it is necessary