A good hash function is essential for good hash table performance. A good hash function is easy$/-$

efficient to compute and will evenly distribute the possible keys. Comment on the flaw $($if any$)$ of

the following hash functions. Assume the load factor $\backslash$alpha $=$ number of keys

table size $=0\mathrm{.}3$ for all the following

cases.

a$)$ The hash table has size $100$ with positive even integer keys. The hash function is h$($key$)=$

key $\%100$