Which statements about hashing functions are correct?

Group of answer choices

A hashing function may map two or more elements with different keys to the same index in the hash table

A hashing function maps a key to an index in the hash table

The hashing function h$($k$)=$ k is used for direct addressing

A hashing function stores an element in a hash table

A hashing function guarantees a unique output for each key. $($Formally: if h is a hashing function and k and j are two keys such that k is not equal to j$,$ then h$($k$)$ will not be equal to h$($j$)).$