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

using separate chaining $(10$ points$)$

using linear probing $(10$ points$)$