Goal is to design an NFA to accept the regular expression: aa*+ a*b Design an NFA that has three states State S (start state), state 1, and state 2 (final state) Complete the NFA by filling up the blanks below. The edge can either be a or b or a,b or A or x (if there is no edge between the states) The edge from . S to 1 is a S to 2 is 1 to 1 is 2 to 2 is 1 to 2 is