L and ~L are recursive enumerable then L is
(a) Regular
(b) Context free
(c) Context sensitive
(d) Recursive
I had been asked this question in an interview.
My query is from Regular Language & Expression in portion Regular Expressions and Languages of Automata Theory