Consider the following languages Li and context free grammars Gj = ({S, T}, {0, 1, 2}, Rj , S) with Rj below: L1 = . L2 = {0 m+n1 m2 n : m 0, n 0}. L3 = {0 m12m : m 0}. L4 = {0 m12m+1 : m 0} L5 = {0 m+n1 m2 n : m 1, n 0}. L6 = 01 2 R1 : S 0S2 | T; T 0T2 | 12. R2 : S 0S2 | T; T 0T1. R3 : S 0S2 | T; T 0T1 | 01. R4 : S 0S | 1S | 2S | . R5 : S 0S2 | 1. For each grammar Gj , determine if the language generated by it is any of the languages L1, . . . , L6 or not, and give your answer by checking the appropriate box in the following table. (You should mark at least one box on every row. Mark none if none of the languages corresponds to the grammar.)

3. Consider the following languages Li and context free grammars G-(S, T, 0,1,2), Rj, S) with R, below: R,: S0S2 | T; T07212. For each grammar G,, determine if the language generated by it is any of the languages Li,.. . Ls or not, and give your answer by checking the appropriate box in the following table. (You should mark at least one box on every row. Mark "none if none of the languages corresponds to the grammar.) T 2 T3