data structures using in chainingeach location in hash table stores pointer to linked list that contains all the key values that were hashed to that location while the cost of inserting key in chained hash table is ( )the cost for deleting and searching value is given as ( )where is the number of elements in the list of that location howeverin the worst casesearching for value may take running time of (nexercises review questions define hash table what do you understand by hash functiongive the properties of good hash function how is hash table better than direct access table (array) write short note on the different hash functions give suitable examples calculate hash values of keys using different methods of hashing what is collisionexplain the various techniques to resolve collision which technique do you think is better and why consider hash table with size using linear probinginsert the keys and into the table consider hash table with size using quadratic probinginsert the keys and into the table take and consider hash table with size using double hashinginsert the keys and into the table take mod and mod what is hashinggive its applications alsodiscuss the pros and cons of hashing explain chaining with examples write short notes onlinear probing quadratic probing double hashing multiple-choice questions in hash tablean element with key is stored at index (blog (ch( (dk (ak in any hash functionm should be (aprime number (bcomposite number (ceven number (dodd number in which of the following hash functionsdo consecutive keys map to consecutive hash values(adivision method (bmultiplication method (cfolding method (dmid-square method the process of examining memory locations in hash table is called (ahashing (bcollision (cprobing (daddressing which of the following methods is applied in the berkeley fast file system to allocate free blocks(alinear probing (bquadratic probing (cdouble hashing (drehashing which open addressing technique is free from clustering problems(alinear probing (bquadratic probing (cdouble hashing (drehashing true or false hash table is based on the property of locality of reference binary search takes ( log ntime to execute the storage requirement for hash table is ( )where is the number of keys hashing takes place when two or more keys map to the same memory location good hash function completely eliminates collision should not be too close to exact powers of sentinel value indicates that the location contains valid data linear probing is sensitive to the distribution of input values chained hash table is faster than simple hash table fill in the blanks in hash tablekeys are mapped to array positions by is the process of mapping keys to appropriate locations in hash table in open addressinghash table stores either of two values and when there is no free location in the hash table then occurs more the number of collisionshigher is the number of to find free location which eliminates primary clustering but not secondary clustering eliminates primary clustering but not secondaryclustering