Which one of the following hash functions on integers will distribute keys most uniformly over buckets numbered 1 to n for n ranging from 1 to N?
a) h(k)=kmodN
b) h(k)=(k+1)modN
c) h(k)=(2k)modN
d) h(k)=(3k+1)modN