Suppose we have a hash set that uses the standard “mod” hash function shown in the chapter and uses linear probing for collision resolution. The starting hash table length is 11, and the table does not rehash during this problem. If we begin with an empty set, what will be the final state of the hash table after the following elements are added and removed? Draw the entire array and the contents of each index. Write “X” in any index in which an element is removed and not replaced by another element. Also write the size, capacity, and load factor of the final hash table.

set.add(4);

set.add(52);

set.add(50);

set.add(39);

set.add(29);

set.remove(4);

set.remove(52);

set.add(70);

set.add(82);

set.add(15);

set.add(18);