Turing Machine

Question

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.

Comments

i get answer about Lne which is recursive enumerable i.e,for any string in the language it accept it and the string which is not belong to the language it will go into infinite loop and doesn't say about rejection i.e,Lne is recursively enumerable not recursive.

but i dont get the answer to Le.