Hi I have a few questions on hashed data structures in Java and there are a few answers on chegg already but none of them seem to be right.

1) A hashed data structure will store a maximum of 4,352 nodes, the keys are numeric in the range is 0 to 999,999, and the node width is 60 bytes. (show your work)

a) Give the size of the primary storage area array if perfect hashing is used _________________

b) Give the size of the primary storage area array if non-perfect hashing is used _____________

c) Give the density when the structure is full and perfect hashing is used ___________________

d) Give the density when the structure is full and non-perfect hashing is used _______________

Thank you any help is appreacted