hash10

1. Hashing (18) Given a list of input ['a','ab', 'def', 'ghij','k','T', 'mp','x'] and a hash function shown as follows: int HashForString (char* x, int table_size) ( int i, sum0 for (i 0 x[i !-'10' i++) sum x[i] - 'a'; return (sum % table-size); Show what happens when each element in the list is inserted into a hash table of size 8 (i.e., table_size of the above hash function is set to 8) using the following collision policy: (a) (4) Open hash table. Explain what method of insertion you are using. (b) (4) Closed hash table using linear probing (assume that the increment is 1) (c) (4) Closed hash table using quadratic probing (specify your probing function). and disadvantages of the collision strategies in the first three ques- tions? Justify your