Suppose we have a hash map that uses the standard “mod” hash function shown in the chapter and uses linear probing for collision resolution. The starting hash table length is 5, and the table chooses...

Suppose we have a hash map that uses the standard “mod” hash function shown in the chapter and uses linear probing for collision resolution. The starting hash table length is 5, and the table chooses to rehash to twice its former size once the load factor reaches or exceeds 0.5. If we begin with an empty map, what will be the final state of the hash table after the following key/value pairs are added and removed? Draw the entire array and the contents of each index, including any resizing and rehashing necessary. 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.

HashMap map = new HashMap();

map.put(7, "Jessica");

map.put(34, "Tyler");

map.put(17, "Ryan");

map.put(15, "Tina");

map.put(84, "Saptarshi");

map.remove("Tyler");

map.put(7, "Meghan");

map.put(33, "Kona");

map.remove(17);

map.put(6, "Tina");

map.remove(84);

map.put(15, "Daisy");