Purpose: Use the Hashtable Data Structure

Create a DynamicArray (specification described below) and using your Doubly-Linked list to create a Hashtable. The Hashtable is a DynamicArray of LinkedLists. The LinkedLists handle the collisions. Read the Customer.csv data file and store it in a ADT. For example:

class Customer string lastname string firstname string id Sample Data: perez,diana,86824983-3587182 oxford,greg,49451687-6884854 smith,tsung,34722447-9802850 Place each ADT data object into the Hashtable structure using your choice of 3 of the hashing techniques listed in chapter 5. I recommend coding a Hashing Function based on the Customer-id, but you could also use either the first of last name fields. Programmatically determine which of the 3 hashing techniques yields the fewest collisions.

Specification for Dynamic Array:

1. Create a generic structure that can hold any type of data 2. Create a Container that allocates blocks of data in units of 10 3. Using the Customer.csv file data: a. Read in the Customer.csv data file and store each line in Credit Card object b. Insert each Customer object into the container's block c. When the number of Customer objects exceed the container's block size, allocate a new block to double the size of the existing block and copy the data from the old block to the new block. 4. Implement the INSERT and RESIZE functions for your Dynamic Array.

Note: This container must also use integer INDEXES, like an array does, to randomly access the data in the container. In C++, the bracket [ ] operator can be used to support indexing. In Java the get(int) function can be used. Python has the resizing capability built into the list class already, so simply write a Dynamic Array that encapsulates a python list object.