Consider the following structures for implementing a hash table with chaining.

class HashNode $\{$

int key;

int data;

HashNode $*$next;

$\}$

HashNode $*$ Hashtable$[$SIZE$]$;

int hashvalue$($int key$)\{$ return $($key $\%$ SIZE$)\}$

Given these write a precise pseudocode for int delete$($int key$).$