Q4. Let T be a table of size 5. Given is the hash function division, defined as the modulus of a key by the table size. For example, Key = 201410234: %3D Function division example 201410234 % 5=4 1....

Hash  function

Extracted text: Q4. Let T be a table of size 5. Given is the hash function division, defined as the modulus of a key by the table size. For example, Key = 201410234: %3D Function division example 201410234 % 5=4 1. Use the above hash function and any collision resolution to fill in the following keys in table T: 201110111 201120231 201420006 201310236 201610451 2. What are steps do the hash algorithm perform to find the index of the value 201610451 on the hash table T? Key % 5 key 201110111 201120231 1 1 201420004 201310237 201610451 4 2 T: 3 4