When using the division method for hashing, our hash function has the form: H(x) = x mod m why do we normally choose a large prime number for m? Select one: a. Prime numbers are not a good choice for m. b. They are guaranteed to minimize collisions c. They allow for many distinct slots with little chance of collisions d. They are guaranteed to maximize collisions