## Discussion Forum

Que. | Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y' reduces to W, and Z reduces to X' (reduction means the standard many-one reduction). Which one of the following statements is TRUE ? |

a. | W can be recursively enumerable and Z is recursive |

b. | W an be recursive and Z is recursively enumerable |

c. | W is not recursively enumerable and Z is recursive |

d. | W is not recursively enumerable and Z is not recursive |

Answer:W is not recursively enumerable and Z is recursive |