Use your wits to construct an NFA for the following regular expression: (a + b)*a The alphabet is A = {a, b}. For the above question, verify your design using jFLAP with multiple inputs. Turn in the saved NFA in a .jff file and a snapshot that shows the results of multiple run. Please note that your test input must cover sufficient number of cases to demonstrate the correctness of the design. 6(b) For the following regular expression, use (11.2.3, i.e., the algorithm that transforms a regular expression to NFA) to construct an NFA. a*b* For the 2nd question, please draw the intermediate steps while applying the transformation algorithm to the given regular expression. You can show the drawings in either a Word document or on jFLAP design panel and take a snapshot.