Which of the following statements are false?

• A. Every recursive language is recursively ennumerable
• B. Recursively ennumerable language may not be recursive
• C. Recursive languages may not be recursively ennumerable
• D. None of the mentioned