4. Let H be a hash table of size 7 with the hash function h(K,j) (5k +3*j mod 7 implemented using OPEN hashing Assume that HIO], H2, H3 and H[6] are already filled in the hash table so that the hash table looks like: Dd at Consider the following sequence of insert operations: Insert (2, De); Insert (6, D); Draw the hash table after all the above operations have been executed, showing which data elements are in which locations of the hash table. Show your work