Task $1$: Define structures to hold bids. Hint: You may choose either an array or a vector for storage. Note that you may be able to reuse portions of your code from previous assignments to save you time. Look for places you have implemented vectors for storage or a Node structure for a linked list. Reusing code from these labs may save you time.

Task $2$: Initialize the structures used to hold bids.

Task $3$: Implement code to free storage when a class is destroyed.

Task $4$: Implement code to calculate a hash value using the bid ID as the source for calculating the key.

Task $5$: Implement code to insert a bid. Be sure to check for key collisions and use the chaining technique with a linked list to store the additional bids.

Task $6$: Implement code to print all bids.

Task $7$: Implement code to remove a bid.

Task $8$: Implement code to search for and return a bid.

Here is sample output from running the completed program: