Suppose hash-keys are drawn from the population of all positive integers that are multiples of some constant c, and hash function h(x) = x mod k, and k is a positive integer. For what values of c will h be a suitable hash function, i.e., a large random choice of hash-keys will be divided roughly equally into buckets