I'm finally back.  I was rushing too quickly Thurs eve and missed a couple
things about asn 8.

1) Please ignore the check_hash function that I accidentally left in there.
   Its mearly the remains of a hurried hack.

2) There was a bug in the example run outputs that I included in the template.
   Clearly the number of unique and total words should be exactly the same
   in all of the runs no matter what hash function is used.  The correct
   answer is 12816 unique words and 210333 total words.  I have corrected
   the online template to reflect these results and to remove check_hash().

3) Note that most_frequent_entry will be the table index of the entry with
   the highest count so you will not have to make a separate copy of the
   most frequent word.

4) Since the hashtable already exists and does not use memory allocation you
   will not be using pointer notation to access the structure.  Instead you
   will use the dot struct notation this week.

5) Be sure you take an honest stab at making an original hash function of
   your own design that is more novel than just changing the values of a
   and b from the book_hash().

6) Beware of off by one errors when wrapping around from the bottom to the
   top of the table during collisions.  This error will not always make your
   program crash but may silently produce an incorrect result.