9. Let L ≤ ML’ denote the language L is mapping reducible (many to one reducible) to language L’. Which one of the following is True?
(a) If L ≤ pL’ and L’ is semidecidable then L is semidecidable.
(b) If L ≤ pL’ and L is RE then L’ is RE.
(c) If L ≤ pL’ and L is decidable then L’ decidable.
(d) If L ≤ pL’ and L is recursive.
Solution: Option (a)
PLEASE Explain