3 Hash tables (10 pts) Let T be a hash table of size 5. 1. Find a simple hash function h(k), that, for any given integer k, computes the index of a slot in the table. 2. Represent what happens when inserting the keys 1, 18, 6, 10, 13, 17, 45, 21, 30 with collisions resolved by chaining, using h(k): complete the diagram below to represent the resulting data structure. 2 2 3 4