$($c$)$ A hash table of size in contains two fields$-$an integer data field and an integer link field $($called data and next, say$).$ The next field is used to link data items in ascending order. A value of $-1$ indicates the end of the list. The variable top $($initially set to $-1)$ indicates the location of the smallest data item.

Integers are inserted in the hash table using "open addressing with double hashing". Assume that the function $h1$ produces the initial hash location and $h2$ produces the increment. An available location has the value Empty and no item is ever deleted from the table.

Write programming code to search for a given value key. If found, do nothing. If not found, insert key in the table and link it in its ordered position. You may assume that the table contains room for a new integer.

$[8$ marks$]$

$[$Total marks: $19]$