Identify the following languages as CFL or non$-$CFL$.$

$\{0$n$1$m$|$n$=2$m$+1\}$

$\{0$n$1$m$|$n$!=$m$\}$

$\{0$n$1$m$|$n$!!=$m$\}$

L$=\{$ambnckdt$|$if$($m$=$n$)$then$($k$=$t$)$

$\{$ap$|$pisprime$\}$

$\{0$n$1$m$|$n$=$m$\}$