(2) Find Regular Expressions for the following languages. L2 = { all strings with exactly two 'a's) = (a, b,c} L = { 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" optio Submit your screen shot from JFLAP. Convert the following NFA into an equivalent DFA. You should show a table! (initial state: qo, final states:q3 and 44, L - {a}) 91 92 93 qo 95 Construct a right-linear grammar for the language, L={a" 6": n 1, m 2)