This question is from my Theory of Automata assignment. Can you answer this?

6. Convert the grammar G with productions P = {S AaB, A AA|as|a, B ABB|bs|b} into Chomsky Normal Form (CNF). Page 3 of 4 (b) Let L be the language L {0^1^2"]n 2 1}. That is, L consists of all strings with an equal number of each symbol, e.g., 012,001122, and so on. Prove that, L is not context-free. (c) Let L be a context-free language and L2 be a regular language. Prove that the language Lin L2 is context-free