Q$1.$ The language $L$ is defined by symbols $=\{0,1\},$ written as follows. Proof that

language $L$ is not regular language

$L=\{w|w$ contains $N$ number $of1$ followed $byN$ number $of$ zeros $\}$

A$1)$

Q$2.$ Design context$-$free grammars for the following languages

$L=\{a^i{b}^j{c}^k|i=j+k\}$

A$2)$#ANSWER SHOULD BE HANDWRITTEN