E x ercise $14\mathrm{.}3\mathrm{.}4$: Some hash functions do not work as well as theoretically

possible. Suppose th at we use the hash function on integer keys i defined by

h$($i$)=$ i$2$ mod B $,$ where B is the number of buckets.

a$)$ W hat is wrong with this hash function if B$=10?$

b$)$ How good is this hash function if B $=16?$

c$)$ Are there values of B for which this hash function is useful