(1) 1.1.27 (using by induction method) (P15 of Linz's book) Show all steps Find a grammar that generates Lj. Li = {aNb 2(N-1): N2 1}, { = {a, b} (3) Draw a DFA for L2. L2 = {w: Na(w) mod 3 8 0 }, } = {a} (4) Draw a DFA and an NFA for L3. L3= { all strings with exactly one "1"}, = {0, 1,2} (5) Convert the following NFA into an equivalent DFA (initial state: qo, final states:q3 and q4, = {a}) 04040 'O 107005