The hash coding method described in the text links all the entries having the same hash code together on a linked list. An alternative method is to have only a single n- slot table, with each table slot having room for one key and its value (or pointers to them). If the hashing algorithm generates a slot that is already full, a second hashing algorithm is used to try again. If that one is also full, another is used, and so on, until an empty is found. If the fraction of the slots that are full is R, how many probes will be needed, on the average, to enter a new symbol?

Hash table is a data structure in which keys are mapped to array positions by a hash function. The process of mapping the keys to appropriate locations in a hash table is called hashing. Hash functions are used to reduce the number of collisions. i. Mention the methods to minimize collision. ii. Explain the advantage of using double hashing over linear and quadratic probing techniques. Load the keys given below in a hash table of size 7 in the same order using chaining with the hash function h(key)= key % 7. Show graphically how collisions are resolved using chaining in this particular case. ii. 12, 101, 3, 21, 14, 13, 16, 7, (last two digits of your reg # + 102)

Why is it giving me an error and what do I have to change? PYTHON # Problem 2# Implement a hashtable using an array. Your implementation should include public methods for insertion, deletion, and# search, as well as helper methods for resizing. The hash table is resized when the max chain length becomes greater# than 3 during insertion of a new item. You will be using linear chaining technique for collision resolution. Assume# the key to be an integer and use the hash function h(k) = k mod m where m is the size of the hashtable. You can use# python list methods in your implementation of the chain or you can also use your linked list implementation from# coding assignment 2, problem 1. You can make necessary changes to  __hashtable initialization in the __init__ method# if you are using your linked list implementation. The provided code uses python lists for the __hashtable variable. class HashTableChain:    def __init__(self, size=10):        # Initialize the hashtable with the given…