Consider a language over the alphabet $\backslash$Sigma $=\{0,1\},$ where all of the strings has length n where

n in $\{2$k $+1|$ k in Z$+($non$-$negative integer$)\}$ and start with $1($e$.$g$.1,110,101,11111,$ etc.$).$