Q$3$: Assume we have the following string keys:

$$John$,$Peter$,$Ali$,$Mary$,$Jacob$,$Emily$,$James$,$William$$

We want to store these keys in a hash table of size $m=5$ using the chaining method.

First, convert the string to integer keys using the Polynomial accumulation method $($that

uses ASCII values of the characters$).$

Then, use the Multiplication method $($which is a compression map$)$ to map the keys to their

correct locations in the hash table.

Show the resulting hash table $($show the names in the linked lists of the hash table$).$