need some help

The "division method" is an easy way implement a compression function on a hash table. What additional step might help avoid collisions? O Choosing a prime number value N for the size of the storage array Limiting the size of the separate chains O Applying the "multiply and divide" method on the result. Applying a 5-bit cyclic shift on the result