I would be really grateful if you could help me out with the details. I am really confused about this assignment. And please don't copy other answers to here.

REGULAR EXPRESSION TO DFA CONVERTER This programming assignment is the construction of a translation tool which converts a regular expression into a DFA, an extension of the previous assignment. The program accepts input from the console in the form of a regular expression, as defined in previous assignments. The output of this program is a finite state table for the DFA machine. The output will be displayed on the console in table form. - Each state can be displayed as a set of states, or the state sets may be relabeled. - The DFA must have a single start state that must be specified. - The DFA may have multiple final states that must be specified. Sample Input ((ab)+(aa)) Sample Output NFA for the expression ((ab)+(aa)) * State a b a 0 [1] [] [] 1. [] [] [2] 2. [] [3] [] 3. [] [] [9] 4. [5] [] [] 5. [] [] [6] 6. [7] [] [] 7. [] [] [9] 8. [] [] [0,4] 9. [] [] [1]] 10. [] [] [8,11] 11. [] [] [8] Start State =10 Final State =11 DFA for the expression ((ab)+(aa)) * State a b 123242 312 412 Start State =[0] Final State (s)=[0,3,4] Or