Please I need help, Here's what I need I have all the code but I need you to fix some errors, my lab is not showing the complete output in the csis.txt output file for the inorder traversal of the binary search tree as well as the queries. A perfect hash function needs to be fixed to satisfy for the signature of the hash function. And the hyphens are being counted as words causing the line position counts to be partly off, Bottom are images of instructions and if interested in helping me please let me know so i can email or provide you all my code.

Each Nord object should provide for the following fields a string for the word to be stored. Note that a word is defined as a sequence of characters separated by a blank, tab, or newline. Punctuation d a word? end of a word should be removed. Therefore, is a hyphen considethe Words should not be case sensitive e an int to count the number of times the word appears in the text . a reference to an object linear linked list in which each object contain number in which the current word can be found as well as the position of th ward on the line. Note that we're counting word-by-word position here a character-b Here is a listing of the classes and interfaces that you will want to include in your project: Xref Word LinePosition Hash Query ObjectBinaryTree objectBinaryTreeInterface ObjectTreeNode ObjectTreeNodeInterface TreeComparable ObjectList objectListInterface ObjectListNode objectListNodeInterface Comparable Specifically, your program should perform the following operations: Input text from a file, getty.txt, and output each line of text prefixed by a line number. Output a well-formatted cross-referenced listing alphabetically by performing an inorder traversal of the binary search tree. Each word, the number of times each word appears in the text, the line number(s), in ascending order, in which each word is found, as well as the position the word appears on each line should be output. Here's a look at the recommended output format: 2 1-7 11-10 our people 3 20-11 21-1 21-4 perish 21-7 Focus on Data Structures Page 454 Each Nord object should provide for the following fields a string for the word to be stored. Note that a word is defined as a sequence of characters separated by a blank, tab, or newline. Punctuation d a word? end of a word should be removed. Therefore, is a hyphen considethe Words should not be case sensitive e an int to count the number of times the word appears in the text . a reference to an object linear linked list in which each object contain number in which the current word can be found as well as the position of th ward on the line. Note that we're counting word-by-word position here a character-b Here is a listing of the classes and interfaces that you will want to include in your project: Xref Word LinePosition Hash Query ObjectBinaryTree objectBinaryTreeInterface ObjectTreeNode ObjectTreeNodeInterface TreeComparable ObjectList objectListInterface ObjectListNode objectListNodeInterface Comparable Specifically, your program should perform the following operations: Input text from a file, getty.txt, and output each line of text prefixed by a line number. Output a well-formatted cross-referenced listing alphabetically by performing an inorder traversal of the binary search tree. Each word, the number of times each word appears in the text, the line number(s), in ascending order, in which each word is found, as well as the position the word appears on each line should be output. Here's a look at the recommended output format: 2 1-7 11-10 our people 3 20-11 21-1 21-4 perish 21-7 Focus on Data Structures Page 454