a. Is the language. L = (b c | n. m e N, msn), a regular language? If yes, draw an NFA/DFA to recognize the language, otherwise use pumping Lemma to show that the language is non-regular. b. Is the language, L = {1" 2n 3m | n. m e N), a context-free language? If yes, draw the pushdown automata (PDA) to recognize the language, otherwise use pumping Lemma to show that the language is non-context-free. c. Consider the following production: [8 marks] S X X XX|2(X)|2|e [8 marks] and prove if the grammar is ambiguous or non-ambiguous considering the string 2 2 (2) 2. [4 marks]