The size of a hash table with n keys

a.) should be a power of 2 for double hashing

b.) should be a prime number for linear probing less than N

c.) should be a prime number and greater than 2N for quadratic probing

d.) should be less than N for separate chaining