if the string of a language L is enumerated then definitely it is countable, so there exists a turning machine which accepts it and halts.so it is Recursive but it cannot be Recursively enumerable because for this language the turning machine doesn't get halt.
Answer:opt c