(1) Find an NFA that accepts the language Li. E= {a, b} L ( a a (b + b a)* ) (2) Find Regular Expressions for the following languages. L2 = { all strings with exactly two 'a's} = {a, b, c} L3 = { all strings that do not end with "aa" } = {a, b} (3) Using JFLAP construct an NFA with three states that accepts the language (01 + 012) * Using input string "0120101 and 0112, try "multiple run" option Submit your screen shot from JFLAP. Convert the following NFA into an equivalent DFA. You should show a table! (initial state: q0, final states:q3 and 44, = {a}) a 91 92 a 43 > qo a 94 a 95 (5) Construct a right-linear grammar for the language, L = {a" bm:n> 1, m> 2}