Problem 1 Find (1) an NFA and (2) a regular expression for the following languages on fa, b). . L-(w : na (tv)-nb(w) (mod 3) = 0} . L = {w : 2na(w) + 3n6(w) is even) Note: na(w) means the number of a's in the string w, and nb is defined in the same way. Problem 2 (1) Find a DFA for the language L = {a"y": n + m is odd). (2) Then find a regular grannnar for the language L