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 =0. 75. The hash function is Hash(key) = key % P, please answer (a) [2 points] Write down the hash function. (Hint: P is a prime number) (b) [4 points] Draw the hash table with separate chaining. (c) [4 points] Compute the average search time for successful and unsuccessful searches with the same probability, resp. (Hint: Only take the comparison with KEY into consideration)