This questiоn is cоncerned with hаshing with chаining where eаch new element is inserted at the head оf the list. The hash table T has size 10, indexed from 0 to 9. The hash function is h(k) = k mod 10. Assume that the hash table is initially empty. Then elements with key values 143, 120, 99, 80, 63, 48, 35, 24, 15, 8, 3, 0 are inserted into the hash table in the given order. Answer the following questions. (a) The key of the 2nd element on the list in slot 0 is [a] (b) The key of the 2nd element on the list in slot 3 is [b] (c) The key of the 2nd element on the list in slot 5 is [c] (d) The key of the 2nd element on the list in slot 8 is [d] (e) The length of the longest list is [e]