(Answered): python In separate chaining the hash table consists of a list of linked lists. Any items that are ha ...

In separate chaining the hash table consists of a list of linked lists. Any items that are hashed to a particular index are added to the corresponding linked list. Key 0 1 2 hash(key){...} 3 4 5 . Define a class named LinkedlistHashTable class which uses separate chaining to handle collision resolution. Each element of the hash table will itself be a Linked list to store all the keys allocated to that particular slot. The LinkedlistHashtable class contains the following: • A private data field named_size that defines the table size. The default value is 7. • A private data field named_slots that defines a list of Linked lists for hash table. A constructor/initializer that takes an integer, size, as a parameter and creates a "separate chaining" hash table of the size specified. The method should create an empty linked list in each slot of the hash table. • The get_hash_code(self, key) method which takes a key as a parameter and returns the index of the slot where this key is to be stored. The get_hash_code() uses the hash function "key % size". • A method named__str_(self) which returns a string representation of the object formatted as in the examples below. Submit the entire class definition. Keep a copy of your solution to this task because you will be extending it in next question. You can assume that the Linkedlist class is given. For example: Test Result hash_table = LinkedListHashTable() print(hash_table.get_hash_code(2) print(hash_table.get_hash_code(15)) (1 print(hash_table) SSSSSSS