Mention All the steps. Please Answer as soon as possible .

Thanks

i. Demonstrate what happens when we insert the keys 15, 37, 19,4, 21, 33, 12, 26, 46 into a hash table with collisions resolved by chaining. Let the table have 9 slots, and let the hash function be h (k)= k mod 9. ii. Represent the following graphs using Adjacency Matrix and Adjacency List as well F F A B D E