a2 Figure 2 NFA 3. Given the language L-(are ln 20}, defined on = (a,b,c), describe the language, using set notation, L 4. Given the NFA in figure 2, which of the following strings are accepted and which are not: (b) o (c) (e) 01 5. How can you change the automaton in figure 1 to a deterministic fi- nite automaton. Either describe how you would do it or draw the new antomaton 6. Given the string w = uv, with u = abbaaaa and u = bbbb, show 1w1 =