1. Suppose a hash table is full and you try to add a new element. What happens if the new element’s key is already in the table? What happens if the new element’s key is not already in the table? 2....

1. Suppose a hash table is full and you try to add a new element. What happens if the new element’s key is already in the table? What happens if the new element’s key is not already in the table?

2. In the implementation of the table’s findIndex method, the method may sometimes find a key with a value of null. Why does the method need to continue to search?