Use this picture of a hash table for the following few questions:

Assume you are inserting the number $345$ and it hashes to index $45,$ if you were using the linear

probing algorithm at which index would the number $345$ be inserted?

Assume you are inserting the number $87$ into the hash table and hashes to index $3,$ if you are using

quadratic probing at which index would you insert this number?

What is the Big $O$ time to find something in a hash table? Is this always the Big $O$ time to find

something in a Hash Table?