3. Let H be a hash table of size 7 with the hash function h(K) -5* k mod 7 implemented using CLOSED (CHAINED) hashing. Consider the following sequence of insert operations Insert (6, D6); Insert (3, D3); Insert(4, D4) Insert (10, Dio); Insert (20, D20); Insert(45, D45): Draw the hash table after all the above operations have been executed, showing which data elements are in which locations of the hash table and how they are stored. Show your work