namespace HashingLab{ class HashTable < T > where T : IKeyed…

namespace HashingLab{ class HashTable < T > where T : IKeyed { private T occupied; //optional parameter useLinearProbing defaults to false public HashTable(int theSize, bool useLinearProbing = false) {….} public void addItem(T theItem) {….} public bool retrieveItem(ref T theItem) {….} public int hashFunction(int keyValue) {….} }}

A hash table producer is considering a probing function, in…

A hash table producer is considering a probing function, in which the iteration of probing starting with home position   reaches the array cell at index  modulo  , where is the table size. (15 pts) What is the most important question you would ask when deciding whether this probing function is a good idea for a hash table of a given size ? (25 pts) Is this probing function a good idea when   ? Justify your answer. Show all work.