$($python$)$ TASK $1(20$ pts$)$: Implement the HashTable class provided be the slides $($Search and Sort$\_$MapADT$)$: You can choose to define it within the main.py$,$ or create another HashTable.py and imports it back in main.py

TASK $2(20$ pts$)$: Create a HashTable object named h and fill in with a list of strings of different animals and print it out to the screen

Sample output: $[77,44,55,20,26,93,17,$ None, None, $31,54][\text{'}$bird$\text{'},$ 'goat', 'pig', 'chicken', 'dog', 'lion', 'tiger', None, None, 'cow', 'cat'$]$

TASK $3(20$ pts$)$: Modify the Hash Table into chained tables.

Reference chained hash table $,$ modify your HashTable class to make both slots and data as chained lists, then print the same test case$($as h$1)$ out to the screen

Sample output: $[[77,44,55],[],[],[],[26],[93],[17],[],[],[31,20],[54]][[\text{'}$bird$\text{'},$ 'goat', 'pig'$],[],[],[],[\text{'}$dog$\text{'}],[\text{'}$lion$\text{'}],[\text{'}$tiger$\text{'}],[],[],[\text{'}$cow$\text{'},$ 'chicken'$],[\text{'}$cat$\text{'}]]$