Which of the following is TRUE about hash functions when used for hash tables? $($Select all that apply.$)$

Group of answer choices

a hash function should return the same index every time it is called for a particular data element

hash functions must use the modulo $(\%)$ operator

the best hash function is one that causes no collisions

none of these

a good hash function evenly distributes data