chap searching (chow many students must be in the class for the probability to be at least that there are who share birthday in the same month assume that you are hashing key to hash table of slots (indexed from to for each of the following functions ( )is the function acceptable as hash function ( would the hash program work correctly for both insertions and searches)and if sois it good hash functionfunction random(nreturns random integer between and inclusive (ah(kk/ where and are integers (bh( (ch( ( random( )mod (dh(kk mod where is prime number assume that you have seven-slot closed hash table (the slots are numbered through show the final hash table that would result if you used the hash function (kk mod and linear probing on this list of numbers after inserting the record with key value list for each empty slot the probability that it will be the next one filled assume that you have ten-slot closed hash table (the slots are numbered through show the final hash table that would result if you used the hash function (kk mod and quadratic probing on this list of numbers after inserting the record with key value list for each empty slot the probability that it will be the next one filled assume that you have ten-slot closed hash table (the slots are numbered through show the final hash table that would result if you used the hash function (kk mod and pseudo-random probing on this list of numbers the permutation of offsets to be used by the pseudo-random probing will be after inserting the record with key value list for each empty slot the probability that it will be the next one filled what is the result of running sfold from section on the following stringsassume hash table size of slots (ahello world (bnow hear this (chear this now using closed hashingwith double hashing to resolve collisionsinsert the following keys into hash table of thirteen slots (the slots are numbered through the hash functions to be used are and defined below you should show the hash table after all eight keys have been inserted