The Module One Resources section. Name the project "HashTable:

Task $1$: Task $1$ has already been done for you. Hint: You may be able to reuse portions of your code from previous assignments to save you time. Look for places where you have implemented similar functions to perform these tasks and take advantage of existing code's reusability whenever possible. You may have to modify the code slightly for each assignment, especially when working with 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.