Let and be finite alphabets and let # be a symbol outside both and . Let be a total function from to . We say is computable if there exists a Turing machine which given an input in , always halts with on its tape. Let denote the language .
Which of the following statements is true:
- Ais computable if and only if is recursive.
- Bis computable if and only if is recursively enumerable.
- CIf is computable then is recursive, but not conversely.
- DIf is computable then is recursively enumerable, but not conversely.

