Hashtable

Implement the Hash Table data structure using two variations of the chaining mechanism for resolving collisions. The first variation uses a simple linked list to store values that were hashed to the same slot, whereas the second variation replaces the linked list with a Red-Black Tree. Your goal is to evaluate the differences in the time efficiency of the variations under different conditions, e.g. number of elements, load factors, etc. You should measure the times taken for searching and insertion operations under different conditions. Present the experimental results using graphs and tables. Note: As a hash function you may use the hash function provided by the programming language you are using (e.g. hashCode() in Java).