Let A ≤m B denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?

• A. If A ≤m B and B is recursive then A is recursive
• B. If A ≤m B and A is undecidable then B is undecidable.
• C. If A ≤m B and B is recursively enumerable then A is recursively enumerable
• D. If A ≤m B and B is not recursively enumerable then A is not recursively enumerable