The language L $=0$

$1$

$0$

$1$

$$

is not a context$-$free language.

Prove that its complement $-$L $($the set of all strings of $\{0,1\}$ not in L$)$ is$.$

$($As a result, because the complement of $-$L is not context$-$free, we know that CFLs are not closed

under complement.$)$