Hash Table calculations. $($Total: $28$ points$)$

Consider inserting the keys $10,22,31,4,15,28,17,88,59$ into a hash table of length $m=11$ using a hash function $h(k)=k$ mod $m.$ Illustrate the result of inserting these keys

a$.$ using separate chaining $(5$ points$)$

b$.$ using linear probing, $(5$ points$)$

c$.$ using quadratic probing $(8$ points$)$

d$.$ using double hashing with $h_1(k)=$kmodm and $h_2(k)=1+(kmod(m-1)).(10$ points$)$