Q. If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

• (A) recursive enumerable
• (B) recursive
• (C) context free language (cfl)
• (D) none of them