Q. Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is
✅ Correct Answer: (D)
Recursively enumerable