Consider the following method that implements getting a key$/$value pair from a chaining hashtable. There are two potential ways to check if an entry in a list is the one being looked up $-$ we could use equals$()$ or hash$(),$ both shown below. Why do we prefer using equals? $($If needed, assume that no resizing ever occurs.$)$

public Value get$($Key key$)\{$

for$($Entry e : entries $[$hash$($key$)])$

if $($e$.$key, equals $($key$))//$normal way

$//$if$($hash$($e$.$key$)=$ hash$($key$))//$alternative way

return e$.$value;

return null;

$\}.$

private int hash$($Key key$)$ i

return $($key$,$ hashcode$()$ & $0$x$7$fffffff$)\%M_{\text{;}}$