0.1 Assume a hash table utilizes an array of 13 elements and that collisions are handled by separate chaining. Considering the hash function is defined as: h(k)-k mod 13. i) Draw the contents of the table after inserting elements with the following keys: 5, 38, 127,21, 16, 210, 28, 19, 150, 201, 332, 95, 123, 10, 30 ii) What is the maximum number of collisions caused by the above insertions