7. Let H be a hash table of size 245 with the hash function h(K) = 15 * k mod 245 implemented using CHAINED hashing. Explain why h is NOT a good hash function. 8. Consider a hash table implemented using CHAINED HASHING. Assume that there are n elements in the hash table and that the hash table size is n6/7. (a) What is the WORST CASE running time for retrieving an element from the hash table? Justify your solution. (b) What is the EXPECTED time for retrieving an element from the hash table? Justify your solution. 7. Let H be a hash table of size 245 with the hash function h(K) = 15 * k mod 245 implemented using CHAINED hashing. Explain why h is NOT a good hash function. 8. Consider a hash table implemented using CHAINED HASHING. Assume that there are n elements in the hash table and that the hash table size is n6/7. (a) What is the WORST CASE running time for retrieving an element from the hash table? Justify your solution. (b) What is the EXPECTED time for retrieving an element from the hash table? Justify your solution