exercises if the amount of information associated with each key is relatively large (compared to the key itself)this information should not be stored in the hash table explain why and propose scheme for representing such set of data consider the proposal to solve the clustering problem by constructing overflow trees instead of overflow listsi of organizing those keys that collided as tree structures henceeach entry of the scatter (hashtable can be considered as the root of (possibly emptytree compare the expected performance of this tree hashing method with that of open addressing devise scheme that performs insertions and deletions in hash table using quadratic increments for collision resolution compare this scheme experimentally with the straight binary tree organization by applying random sequences of keys for insertion and deletion the primary drawback of the hash table technique is that the size of the table has to be fixed at time when the actual number of entries is not known assume that your computer system incorporates dynamic storage allocation mechanism that allows to obtain storage at any time hencewhen the hash table is full (or nearly full) larger table his generatedand all keys in are transferred to 'whereafter the store for can be returned to the storage administration this is called rehashing write program that performs rehash of table of size very often keys are not integers but sequences of letters these words may greatly vary in lengthand therefore they cannot conveniently and economically be stored in key fields of fixed size write program that operates with hash table and variable length keys references [ maurer an improved hash code for scatter storage comm acm no ( ) - [ morris scatter storage techniques comm acm no ( ) - [ peterson addressing for random-access storage ibm res dev ( ) - [ schay and spruth analysis of file addressing method comm acm no ( -