Suppose the keys A to G are inserted into the blank hash table with linear survey....

 

Transcribed Image Text:

Suppose the keys A to G are inserted into the blank hash table with linear survey. We don't know the order of the insertions, but the final position of the hashtable is this: 0 1 2 3 4 5 6 FL D E A G B C Assume that the hashtable has 7 seats and its size changes not. For each key, say whether it could have been the last the key that was inserted into the hash table. If it's possible, show the sequence of key insertions that causes it, but otherwise argue that it's not possible. Hint: For example, D cannot be the last inserted key, because then A or E would have hit position 1, but not D (because D has a hash value of 0). key hash value A 1 B 5 C 6 D 0 E 1 FL 6 G 4 Suppose the keys A to G are inserted into the blank hash table with linear survey. We don't know the order of the insertions, but the final position of the hashtable is this: 0 1 2 3 4 5 6 FL D E A G B C Assume that the hashtable has 7 seats and its size changes not. For each key, say whether it could have been the last the key that was inserted into the hash table. If it's possible, show the sequence of key insertions that causes it, but otherwise argue that it's not possible. Hint: For example, D cannot be the last inserted key, because then A or E would have hit position 1, but not D (because D has a hash value of 0). key hash value A 1 B 5 C 6 D 0 E 1 FL 6 G 4