java please and try to make it simple as much as you can

Input : NDFSA Output: DFSA with fewest states. Write a program (in C or JAVA) that reads from a text file a NDFSA in the following format: Line-l: - Set of states Q, a subset of (A, B, ...,Z uppercase letters) up to a maximum of 10 states. - The first letter represents the starting state of the machine Line-2 : Final states FIQ Line-3 : - Alphabet of the machine V, a subset of (a, b, ..., Z) in addition to special symbols up to a maximum of 20 symbols. @=1 Line-4: - transitions between states - Ex: BCd CE+ DB @ Your program should transform the given NDFSA to DFSA with fewest states using the tabular method, that is, using tables. - The output of your program is the final transition table. Your program must examine if a given string is accepted or rejected by the final reduced machine, showing each step in the recognition process. - No projects will be accepted after the deadline. Your program will be examined with a random file. - You may program your project using Cor JAVA only