Using java

Define the following terms: a) hash table b) hash function c) perfect hash function a) What is a collision? b) Explain three ways of handling collisions (a program is not needed; a clear brief explanation suffices). Consider a hashing scheme that uses linear probing to resolve collisions. a) Design an algorithm (no code necessary) to delete an item from the hash table. b) What precautions do you need to take to make it work properly? Given the following data: 25 - 42 - 96 - 101 - 102 - 162 - 197 a) Construct a hash table using the hash function, h(key) = key mod table size, where the size of the table is 11. Use the rehash function, rh(key) = (key + 3) mod table size to resolve collisions. b) Construct a second hash table using the same hash function as above, but use chaining to resolve collisions