Consider a hashing scheme that uses linear probing to resolve collisions. Design an algorithm (no code necessary) to delete an item from the hash table. What precautions do you need to take to make it work properly? Given the following data: 25-42-96-101-102-162-197 Construct a hash table using the hash function, h(key)=key mod tablesize, where the size of the table is 11. Use the rehash function, rh(key)=(key+3) mod tablesize to resolve collisions. Construct a second hash table using the same hash function as above but use chaining to resolve collisions