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 NFA-^ CONVERTER This programming assignment builds on the previous one to construct a program to convert regular expressio into NFAs with transitions. Your program should accept input from the console in the form of a regular expression, as recognized in the previous assignment, from the alphabet {a,b,+,,(),}. The output of this program is a finite state table representation of the NFA machine. The output will be displayed on the console in table form. - Transitions from each state should be displayed as a set of destination states. - The NFA will have a single start state, which must be specified. - The NFA will have a single accept state, which must be specified. - Indicate epsilon-transitions with the symbol 'e'. Additional credit will be given for particularly intuitive/helpful interfaces. The number of characters in the regular expression will not exceed 1,000