Requesting assistance with the Theory of Computing
1) Transform the following grammar to the Chomsky normal form;
S-->aACa, A -->B|a, B--> cC|e
2) Let L be the language with equal number of a's and b's. Explain whether the L is regular or context free? Describe the grammar that produces L.
3) Construct a PDA that accepts L.