Poor Hash Function

ALL

$11$

$11$

$$

$14$

$14$

The idea is to store the key, value pair $(k,e)$ at index Collisions will be handled using chaining or linear probing.

Which of the following functions is least suitable for use as the hash function $h(x),$ given that $x$ is a non$-$negative integer?

$gcd(x,y)$ represents the Greatest Common Divisor of two positive integers $x$ and $y.$

Pick ONE option

$h(k)=(k^{**}k)\%N$