java assignement

You will be supplied with a list of 40,000+ records of data about people. The task is to read the file into a linked list, and then build a balanced binary tree in ascending alphabetical order by last name. The [login to view URL] file has the entire list. The [login to view URL] file contains the first few records of the [login to view URL] file for use in debugging your code. I have provided a template of technique for reading data from a file: filereader.java. This program will create a doubly-linked list of all the records in the file. Your task is to traverse the linked list of records, and add each record to the binary tree. The tree must be in order at all times. The tree must be balanced using the AVL technique in which some nodes are rotated each time the addition of a new item causes the tree to be imbalanced. If you encounter duplicate names, discard the second and subsequent records, or use another consistent approach to ordering your tree. Measure the execution time of the tree building operation, and report it to a GUI. Also, print the last 10 values of LAST NAME from an “in-order” traversal to a GUI. For those 10 In addition to building the tree, your GUI should allow the user to search for a specific last name. After the tree is built, your GUI should accept a search string, measure the time to find the correct record, and display all the fields of the found record in a text area. Or, if the search does not produce a result, your application should indicate a failed search. The user should be able to search as often as they want without having to rebuild You may not use predefined tree classes for your code. You may not use any code you download from the internet, or are given by someone else. You must write your own.