Searching an open addressing hash table

Given a key k$,$ the HASH$\_$SEARCH$($T$,$ k$)$ procedure searches for the key k in the hash table

T$.$ This hash table is implemented as an array T$[1..$m$],$ and includes a hash function h$($k$,$ i$)$ that, for every key k$,$ the probe sequence $($h$($k$,0),$h$($k$,1),.,$h$($k$,$m$-1)]$ is a permutation of $(0,1..,$m$-1].$ The HASH$\_$SEARCH$($T$,$ k$)$ procedure returns the index j where the key k is found or NIL if the key is not in the hash table. Identify the missing piece of code.

HASH$\_$INSERT$($T$,$ k$)$

i $=0$

repeat

j $=$ h$($k$,$ i$)$

if Tril BE NIL

return j

else $1=1+1$

until i as m error "hash table overflow"