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