Perform an analysis of hash table number of collisions versus load factor as a function of collision resolution scheme and hash function.

Choose three hash table sizes.

For each hash table size, randomly generate key values between 0 and 3 times the hash table size. As each key value is placed in the hash table, record the current load factor and the number of collisions that have occurred.

Perform this experiment for four combinations of hash function and collision resolution scheme.

Hash functions: key mod table size, mid square (square the key, then middle digits modulo table size).

Collision resolution schemes: separate chaining, open addressing.

Thus there are 4 experiments with three table sizes per experiment.

Could you please do an example for 1 combination of hash function and collision resolution scheme? Please code in either Java or C++. Using Java's built in functions is OK.

Create plots as below for each experiment. 30 25 Size 1 Size 2 Size 3 15 e 10 0 0.2 0.4 0.6 0.8 1 1.2 Load Factor