9. (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, 15, 1, 2, 4, 18, 13, 9, 20, 10, 12. 10. (10 points) Write a method that receives a hash table H that solves collisions by chaining and an integer k and returns the largest element in H that has the same hash value as k, or -1 if no element in H has the same hash value as k ration of the heap after the code is executed heap H neu heap(10); 11. (8 points) Consider the following code fragment where H is used to represent a heap. Show the configu- for (int i-10;i>0;i--) H.insert (i*10); System.out.println(H.extractMinO) System.out.println (H.extractMin)); H.insert (25); H.insert (15)