Please answer BOTH parts of the question.

A) Give a nondeterministicfinite automaton (NFA) that accepts the language generated by the regular expression (a + ba + baaa)" B) Give an NFA (nondeterministic finite automata) L={w w is a string built from the following alphabet - {0,1,2,3,4,5,6,7,8,9} and the last digit in the string w HAS appeared previously in the string. For example, 2322453 IS in the language L since the 3 has appeared earlier in the string. However, 22423532437 is NOT in L since the 7 has not appeared previously in the string