Following are two hash functions. Neither is a very good hash functions. Explain why they are not good hash functions and give an example showing them working poorly.

a Hash keys are character strings. The hash function h1(x) computes the length of a string.

b The function h2(x) computes a random number r where 0 r < B where B is the number of buckets. It returns r.