1. Insert the keys 3, 13, 20, 21, 32, 39, 43, 45 in that order into an initially empty table of m=5, using separate chaining. Use the hash function h(k)=11*k % m. Show what hash table looks like after each insertion.

2. Insert the keys 3, 13, 20, 21, 32, 39, 43, 45 in that order into an initially empty table of m=15, using linear probing. Use the hash function h(k)=11*k % m. Show what hash table looks like after each insertion.