Non$-$Context$-$Free Languages. Consider the alphabet $=\{0,1\}(5$ points each$)$

$($c$)$ Define $L_1=\{O^i{1}^j$:$j=i^2\}.$ Use the CFL Pumping Lemma to show that $L_1$ is not

context$-$free.

$($d$)$ Let $L_2$ be the language of all palindromes over $$ containing equal numbers of $0s$ and $1s.$

Prove that $L_2$ is not context$-$free. problem solving and

Provide NEAT and COMPLETE

solutions to the following problems.

sjow your solution