java question
 

1. You are given a hash table of size 100. Using a hash function, what key will element 334 be stored in the table? 2. You are given a hash table of size 50. Using a hash function, what key will element 201 be stored in the table? 3. A hash table has 10 rows. If the hash table is initially empty, and the following inserts are applied in the order shown, which insert results in a collision? Please show the table after each insert. Insert 55 Insert 90 Insert 95 I 4. Using chaining, show the result of the hash table of size 5. Insert 45 Insert 42 Insert 19 Insert 87 Insert 18 5. Using linear probing, show the result of the hash table in the previous question.