Suppose that we want to insert the keys {10,6,2,12,7} into a table with m=5 slots. Illustrate the table after inserting all keys for the following 2 cases: 1) Using chaining to resolve collisions and the division method as the hashing function. 2) Using open addressing with linear probing and the division method as the hashing function