(You have all day Monday to work on it. One minute into Tuesday is too late.)

For this assignment, I'd like you to investigate the relationship between the likelihood of getting collisions in the hash table and the following factors:

- Hash table size (try sizes as low as a quarter million and go up no more than 1-8 million)
- Whether of not the table size was a prime number (try prime numbers and then successive non-primes - you may also want to try powers of 2 - or even powers of 31).

See the comments at the start of the provided code for further details.