make a python hashtable code that request :-user input on whether user collisions throughlinear probing,or cubic probing. -user input on what values to insert in hashtable -user input on hashtable size. then solve collision based on user choice. add functions to keep track of counts as shown in photo.more informatiom as shown in photo..

Implement Dictionary ADT with a hash table that handles collisions using a closed hash of type Linear, Quadratic and cubic probing. For the hashing method, keep a record of the following data and analyze them in your report: - The number of collisions that are generated. - The size of your hash table. - You will need to time to calculate how long takes you to implement the system - Additionally, you will need to keep track of various counts that reflect the amount of work that the scheme had to do (quadratic or cubic). For example, a. hash_comp // keeps track of total number of comparison of keys needed while searching hash table b. hash_next_success // keeps track of total number of times that the hashing scheme has to move to another slot during successful searches c. hash_next_fail // keeps track of total number of times that the hashing scheme has to move to another slot during failed searches Scope: GUl based hash algorithm. requirements: a. user to make choice of type of hash algorithm, input and table size Full coding in Python