Allocate the following integer into a hash table as follows: Elements: 10, 16, 21,31 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 0 index 1 2 4 5 6 7 8 9 10 element