Allocate the following integer into a hash table as follows: Elements: 1, 11, 20, 23 Size of hash table: 11 Hash function: h(k)= k % 11 (k is the element) Resolve any collisions by function h(k)= (h(k)+1) % 11 index 0 1 2 3 4. 5 6 7 8 9 element 10