Suppose you have a hash table with seven entries (indexed 0 through 6). This table uses open addressing with the hash function that maps each letter to its alphabet code (a = A = 0, etc.) modulo 7. Rehashing is accomplished using linear-probing with a jump of 1. Describe the state of the table after each of the letters D, a, d, H, a, and h are added to the table.

#. Consider a hash table of size 7 with hash function hash(k) = k mod 7. Draw both hash tables (Closed-Bucket and Open-Bucket) that results after inserting, in the given order, the following values: 19, 26, 13, 48, 17, 49, 29, 55, 61, 14, 66.   (Java Programming DSA).

We have a hash map that was not constructed correctly, with all of the values being placed into the same bucket (that is, they are all in the same LinkedList). Explain why this is a violation of the hash map's original intent and why it should be avoided.

In §12.2 Lamport's Hash we mentioned the notion of using only 64 bits of the hash. At each stage, 128 bits are computed, 64 bits are thrown away, and the hash of the retained 64 bits is used in the next stage. The purpose of only using 64 bits is so that a human does not need to type as long a string. Assuming the person will still only type 64 bits, does it work if hashn does a hash of all 128 bits of hashn-1, but what the person actually transmits is 64 bits of the result?

We have a badly built hash map in which all of the stored values are in the same bucket (that is, they are all in the same LinkedList). Explain why this negates the benefits of a hash map.

Store a dictionary of a limited set of words as a hash table. Implement a spell check program that, given an input text file, will check for the spelling using the hash table-based dictionary and in the case of misspelled words will correct the same.

We have a hash map, however its construction wasn't very good since all of the values were thrown into the same bucket (that is, they are all in the same LinkedList). If this is the case, please explain why it would be ineffective to use a hash map in the first place given the circumstances.

Create a newconcrete class that implements MyMap using open addressing with quadratic probing.For simplicity, use f(key) = key % size as the hash function, where sizeis the hash-table size. Initially, the hash-table size is 6. The table size is doubledwhenever the load factor exceeds the threshold (0.5).