I need help on an assignment, I don't know where to start, I have coded to so far for it to read in the words from a text file and an array for the words to be put into, after that I'm lost as to what the next step would be. Please Help!

we are to take a list of 28500 words (one word per line) and apply 2 hashing functions to each word, don't store in hash table but arrays initialized to zeros. Array size of 5701, ideal expected average size for the chains would be 28500/5701 = about 5

for each function report the average chain length, number of empty chains and the 5 longest

report on goodness of the functions:

number of chains of length zero is less than 10%

length of the longest chain will be less than eight times the expected length of the

average chain.

First Function:

add the Unicode values of each of the Characters in the word and save as an integer

and obtain the remainder using 5701

Second Function:

For each of the following character strings s, compute the location

h(s) = n(smaller subscript s) mod 5701

for this string, mapping each symbol in s to a number between 0 to 127 with base 128 integer