Question $4$

For the alphabet $=\{0,1\},$ the language ${}^{**}-\{0,1\}($the language of all words over $S$ except $0$ and $1)$ can be represented by a regular expression.

True

False