Part 1: Create an optional small GUl program using javax.swing components or have a console output if you prefer not to create GUI. This is just a dummy Ul with no search capabilites in this Part 1 Word to search for. Data Structure Search WordNet Noun data structure ((computer science) the organization of data (and its storage allocations in a computer)) Part 2: A text file will be provided for the database of English words, their type (noun, verb, etc.) and their meaning. Create an efficient hash function to convert each word into an int Key: hash function int Note: the text file will containe single words or multiple words connected via underscore, the type of the word (noun, verb, etc) and its meaning. So if we search for Data Structure, we will find Data Structure which will be valid result to return. Part 3: Implement Linear Probing, Quadtratic Probing, Separate Chaining, Double Hashing techniques discussed in class. Chose an appropriate Lamda value per implementation. Use Key generation in part 2 to store the node (key, type, meaning) in the hash table Part 4: Once a word is searched, output its meaning and provide the information related to each specific implementation in the ouput. For example Word to search for Data Structure Search WordNet Noun . data structure ((computer science) the organization of data (and its storage allocations in a computer)) Total Words: XXXXXXX Data Structure Linear Probing Quadratic Probing Separate Chaining XXX Double Hashing: Table Size Lambda Items investigated Success Yes or No Yes or No Yes or No Yes or No XxX