3. [4] For our running hash table, you'11 need to decide if you need to rehash. You just inserted a new item into the table, bringing your data count up to 53491 entries. The table's vector is currently sized at 106963 buckets. Calculate the load factor (A): Given a linear probing collision function should we rehash? Why? * Given a separate chaining collision function should we rehash? Why? 4. [4] What is the Big-o of these actions for a well designed and properly loaded hash table with N elements? Big-o complexity Function Insert(x) Rehash() Remove(x) Contains(x)