Can i get a help for this problem please?

In java write a Red-Black Tree to be used as a lookup table. Input: input.txt which has( id, first, last, age) 5 kev Nguyen 29 6 Alex Yoder 31 7 Zain Davis 37 8 Joe Garv 52 9 Kim Mark 37 10 Mat Walker 61 Output: Names as requested. Problem Description: Create a program that accepts a series of names in the above format in as a text file. Construct a RedBlack Tree using that data. Use last-name, first-name pairs as your keys. (i.e. organize by last name, but using first name where last names are the same, just as you would sort by last name).Lookup tables are useful and important tools for organization. Create a simple command line tool for looking up records in your tree. If a user enters a last name, provide possible matches, if any exist (please ignore case). If the user puts a ! at the end, print out each record that is compared to find the matching record. If a user enters a single letter with a ? after it, print out all the records that have a surname beginning with K. (e.g., the user will enter K ?, and starting with the first surname beginning with K, print out all the following, matching records). Time each of these operations and output the record along with the time it took to complete each operation. If they press enter with no command, exit. Summary of commands: Name find record and print it Name ! find record, but print all records compared to find it along with the record Letter ? find and print all records that begin with that letter No command - exit