2. [20pt] (Submit a JFLAP file and a print out on your HW answers) Convert the following regular expressions to NFAs using the procedure given in Theorem 1.54 (Lemma 1.55) of the textbook. In all parts, = {a,b)(10pt each]: (a) *a" (b) (aUew Note: Follow the procedure used in examples1.56 and 1.58 of the textbook. Draw all the steps in your print out answer (Hint: The following is not part of your submission: There are two possible ways to gain confidence in your answer. Try to verify your final answer in two ways: . Translate the NFA back to a regular expression. Does the answer match the initial regular expression? . "Determinize" the NFA and then minimize the resting DFA. Does this resu ing DFA match your intuition of what strings are in the language described by the regular expression?) Remark: Even though submitting 5 rejected and 5 accepted strings is not required it is highly recommended. Think of the process as unit testing of your design