Suppose there are five workers, in a shop, with IDs 909, 185, 657, 116, and 150. Suppose hash table, HT, is of the size 7, indexed 0, 1, 2, ..., 6. Show how these workers' IDs, in the order given, are inserted in HT using the hashing function h(k)= k % 7. Use linear probing to resolve collision.

A hash table with ordered linear probing maintains an order among keys considered during the rehashing process. When the keys are encountered, say, in increasing order, the performance of a failed lookup approaches that of a successful search. Describe how a key might be inserted into the ordered sequence of values that compete for the same initial table entry

How many linked lists does a chaining hash table of size T have in total? To what extent does Separate Chaining's hash table accommodate primitive data types?

Suppose that the keys A through G, with the hash values given below, are insertedin some order into an initially empty table of size 7 using a linear-probing table (withno resizing for this problem). Which of the following could not possibly result frominserting these keys?a. E F G A C B Db. C E B G F D Ac. B D F A C E Gd. C G B A D E Fe. F G B D A C Ef. G E C A D B FGive the minimum and the maximum number of probes that could be required tobuild a table of size 7 with these keys, and an insertion order that justifies your answer.