I am stuck on this problem.

Exercises 1. Let A be the language of strings over the alphabet {a,b} that ends with a symbol that also appears elsewhere in the string. For example, aba E A but bba & A. (a) Draw the state diagram for an NFA N where L(N) = A. (b) Write the formal definition of N. 2. Let A = {1 {0,1}* : I starts with 00} and B = {1 {0,1}* : I ends with 11}. (a) Draw the state diagram of an NFA that recognizes AUB. (b) Draw the state diagram of an NFA that recognizes A o B. =