key terms binary search clustering folding method hash table linear probing median of three mid-square method perfect hash function quick sort sequential search slot bubble sort collision gap hashing load factor merge open addressing pivot value rehashing shell sort split point chaining collision resolution hash function insertion sort map merge sort partition quadratic probing selection sort short bubble discussion questions using the hash table performance formulas given in the compute the average number of comparisons necessary when the table is full full full full full full at what point do you think the hash table is too smallexplain modify the hash function for strings to use positional weightings we used hash function for strings that weighted the characters by position devise an alternative weighting scheme what are the biases that exist with these functions research perfect hash functions using list of names (classmatesfamily membersetc )generate the hash values using the perfect hash algorithm generate random list of integers show how this list is sorted by the following algorithms bubble sort selection sort insertion sort shell sort (you decide on the incrementsmerge sort sorting and searching