Q C4 b) If it is known that the language L1=$\left \{ 0^{n}1^{n}2^{i}\mid n\neq i \right \}$ is not a context free language (CFL). Now consider the language L2=$\left \{ 0^{i}1^{n}2^{n}\mid i\neq n \right \}$. We can prove that L2 is not CFL by converting L2 into L1 by applying two operation, both know to be closed on CFLs. What are two operation you will use for this construction.
