3. Store the keys {26, 36, 15, 38, 44, 41, 68, 51, 6, 12, 14} into a hash table with separate chaining. Suppose the loading factor = . . The hash function is Hash(key) = key % P, please answer

(a) Write down the hash function. (Hint: P is a prime number)

(b) Draw the hash table with separate chaining.

(c) Compute the average search time for successful and unsuccessful searches with the same probability, resp. (Hint: Only take the comparison with KEY into consideration)