Implement the three public functions:$$ a $1-$argument constructor that creates an empty HashTable, given a capacity.$$All values in the table should be set to $-1$ to indicate that they are empty.$$ insert$($x$)$ to put integer x in the table. Use the hash function and linear$$probing to find its proper position. Do not add an element that is already in$$the HashTable.$$ find$($x$)$ to return true if x has been inserted into the table, false otherwise.$$Use the hash function and linear probing to determine the result.