void HashTable::Insert$($Bid bid$)\{$

$//$ FIXME $(5)$: Implement logic to insert a bid

$//$ create the key for the given bid

$//$ retrieve node using key

$//$ if no entry found for the key

$//$ assign this node to the key position

$//$ else if node is not used

$//$ assing old node key to UNIT$\_$MAX, set to key, set old node to bid and old node next to null pointer

$//$ else find the next open node

$//$ add new newNode to end