solve question 1,2,3 pls !

1/ Enter regular expression (a+b) * aaa (a+b) * What kind of syntax errors does jflap detect in a regular expression syntax? 2/ Convert the given regular expression to the equivalent NFA. 3/ Save NFA to a file. Describe how jflap stores the set states and the E-- transitions of theNFA