**The Assignment. **
Design the program so that the filename of the text file is input. Build a separate list (a separate Hash Table) for words of each length 7, 8, 9, 10. The output will be the lists of words (of each length) from the file. [NOTE: here the word lists will not be in alphabetical order, that is not the order they will be stored in the Hash Table.] Read a String (a line of text, decompose the string into tokens (the words), then for each word (by its length), determine if the word is already stored in the Hash Table. If the word is not present, store it in the Hash Table. Otherwise, go to the next word. Repeat, for each line of text in the file. At the end print the contents of each hash table, showing the words of each length.
NOTICE THAT THE OUTPUT WILL NOT BE IN ALPHABETICAL ORDER HERE! THE ORDER IS THE ORDER THE WORD KEYS ARE STORED IN THE HASHTABLE, BY THEIR HASHCODES.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.