4th Edition P767 2(d) Use your wits to construct a DFA for the following regular expression: ab* +c The alphabet is A = {a, b, c} Verify your design using jFLAP with multiple inputs. Turn in the save...

Extracted text: 4th Edition P767 2(d) Use your wits to construct a DFA for the following regular expression: ab* +c The alphabet is A = {a, b, c} Verify your design using jFLAP with multiple inputs. Turn in the save DFA 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.