5. (basic) Consider a hash table with m-11 slots and using the hash function h(k) = k mod 11. Say we insert elements k41, 18, 3,8, 19,5, 1, 7 in this order. Show the final table in the following two cases. In both cases the same hash function h(k) is used. (a) When chaining is used to resolve collisions. Please insert the element at the beginning of the linked list. (b) When open addressing and linear probing are used to resolve collisions