An MNC company has some number of employees whose records with Employee name. Employee number and Designation are represented in a

hashing table. Each Employee number has $4$ digits as $[$d$1$ d$2$ d$3$ d$4].$ The hashing lable contains $100$ block$1$ which are numbered from $0$ to $99$ and

each block can accommodate $1$ record.

When the records are stored in the hashing table, the following algorithm is used:

$(d{1}^{**}(d)2+d3**(d)4)\%$ size of the table

If collision occurs, the rehashing algorithm is changed to $(d1+d2+d3+d4**17)/$size of the table.

Identify where the records with the following keys are stored.

$2138,2400,3200,9999,6789,3456,6356,1234,5790,2222$

$5M$