do all the parts or i will report .please write with neat handwriting

3. Give a context-free grammar that generates the language A = {a Wali=j or j = k where i, j, k 20). Is your grammar ambiguous? Why or why not? 4. Convert the following CFG into an equivalent CFG in Chomsky normal form. A+BAB BC B00 5. (a) Let C be a context-free language and R be a regular language. Prove that the language Cn Ris context free. (b) Let A = {wlw e {a,b,c} and w contains equal numbers of a's. Vs. and s}. Use part (a) to show that A is not a CFL 6. Let A/B = {wux EA for some re B). Show that if A is context free and B is regular, then A/B is context free. 7. Let E = {wWij and 2 + 3} Show that E is a context-free language