Given the following keys {336,121,613, 93, 63, 17, 10, 53} for insertion into a hash table, and using a hash function h(k)= k mod m, m = 11, show the resulting: (i) Quadratic probing hash table (ii)...

Given the following keys {336,121,613, 93, 63, 17, 10, 53} for insertion into a hash table, and using a hash function h(k)= k mod m, m = 11, show the resulting:
(i) Quadratic probing hash table
(ii) Linear probing hash table
(iii) Separate chaining hash table