A formal language is recursive if :
(a) a total turing machine exists
(b) a turing machine that halts for every input
(c) turing machine rejects if the input does not belong to the language
(d) all of the mentioned
The question was asked during an interview for a job.
The origin of the question is The Universal Language-Undecidability in chapter Undecidability of Automata Theory