Consider a hash table with 11 slots. The hash functionis h(k) = k mod 11. The collisions are resolved byopen Hashing(Chaining). The following 11 keys are inserted in theorder: 28, 19, 15, 20, 33, 30, 42, 63, 60, 32, 43. Themaximum, minimum, and average chain lengths in thehash table, respectively, are-

Hash Table Operations:Consider a hash table with 7 slots that uses chaining to resolve collisions. The hash function is h(x) = x mod 7. Show the structure of the hash table after inserting the following sequence of integers: {15, 22, 36, 7, 10, 42, 29}. Demonstrate the process of searching for the number 22 in the hash table.

Collisions can be completely avoided in a hash table by choosing a perfect hash function. Group of answer choicesTrueFalse

Suppose we want to store items a, b, c, d, e, f, g, whose keys are:a.key=23b.key=7c.key=54d.key=21e.key=12f.key=42g.key=39We want to store them in a hash table of size 7 implemented with a dynamic array A, using the hash function h(k) = k mod 7, by handling collisions using chains.Start with the array A being of size 7, with all entries initialised to None (case-sensitive), and insert the items above in order (a, b, c, d, e, f, and then g). Fill the blanks with the contents of each entry: if there is only one item in A[ i ], then just write the name of the item (not the key!), for instance "c" without the double quotes; if A points to a chain containing multiple items, just list them in alphabetical order by separating them with a comma and no spaces. For example, if A[ 2 ] points to a chain containing items a and b, fill the blank next to A[ 2 ] with "a,b" without the double quotes.

Consider a 13 element hash table for which f(key)=key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would the key 103 be inserted, if the keys 661, 182, 24 and 103 are inserted in that order?Select one:a. 1b. 12c. 11d. 0

When should you extend a hash table?Question 28Select one:If the load factor goes to zero.cross outIf the number of keys stored in the table is less than the capacity of the table.cross outIf the number of bins is large.cross outIf there are many collisions.