10. Give the Division Hashing function and the index it maps the key 2000 into, assuming a primary storage area array size of 61 elements and:

a) The range of the keys is 0 to 999,999.

b) The range of the keys is 100 to 999,999.

11. Nodes are to be stored in a hashed data structure that utilizes the direct hashing function. Assuming the key field was an integer ranging from 2000 to 100,000 and the structure will store a maximum of 60,000 nodes:

a) Compute the loading factor of the structure.

b) Compute the density of the structure assuming a node width of 100 bytes.

c) Give the node width that results in a density of 0.7.