Consider the following languages:
Lne={〈M〉│L(M)≠ф }
Le={〈M〉│L(M)=ф }
where 〈M〉 denotes encoding of a Turning machine M
Then which one of the following is true?
(a) Lne is r.e. but not recursive and Le is not r.e.
(b) Both are not r.e.
(c) Both are recursive
(d) Le is r.e. but not recursive and Lne is not r.e.