in Python

5. (5 points) Consider an initially empty hash table H of size 11 that solves collisions by chaining. Show the configuration of the table after performing the following sequence of insertions: 6, 3, 16, 11, 7, 17, 14, 8, 5, 19, 15, 1,2, 4, 18, 13,9, 20, 10, 12. 6. (10 points) Write a met hod that receives a hash table I that solves collisions by chaining and an integer k and inserts k into H if k is not already in H. If k is already in H your method should do nothing. 5. (5 points) Consider an initially empty hash table H of size 11 that solves collisions by chaining. Show the configuration of the table after performing the following sequence of insertions: 6, 3, 16, 11, 7, 17, 14, 8, 5, 19, 15, 1,2, 4, 18, 13,9, 20, 10, 12. 6. (10 points) Write a met hod that receives a hash table I that solves collisions by chaining and an integer k and inserts k into H if k is not already in H. If k is already in H your method should do nothing