next cell is occupied here' the code for find()public dataitem find(int key/(assumes table not fullint hashval hashfunc(key)/find item with key /hash the key while(hasharray[hashval!null/until empty cell/found the keyif(hasharray[hashvalidata =keyreturn hasharray[hashval]/yesreturn item ++hashval/go to next cell hashval %arraysize/wrap around if necessary return null/can' find item as hashval steps through the arrayit eventually reaches the end when this happens we want it to wrap around to the beginning we could check for this with an if statementsetting hashval to whenever it equaled the array size howeverwe can accomplish the same thing by applying the operator to hashval and the array size cautious programmers might not want to assume the table is not fullas is done here the table should not be allowed to become fullbut if it didthis method would loop forever for simplicity we don' check for this situation the insert(method the insert(method uses about the same algorithm as find(to locate where data item should go howeverit' looking for an empty cell or deleted item (key - )rather than specific item once this empty cell has been locatedinsert(places the new item into it public void insert(dataitem item/insert dataitem /(assumes table not fullint key item idata/extract key int hashval hashfunc(key)/hash the key /until empty cell or - while(hasharray[hashval!null &hasharray[hashvalidata !- ++hashval/go to next cell hashval %arraysize/wrap around if necessary hasharray[hashvalitem/insert item /end insert(the delete(method the delete(method finds an existing item using code similar to find(once the item is founddelete(writes over it with the special data item nonitemwhich is predefined with key of -