Answer is (b): both L and L' are recursive
Definition of decidable language:
"a language L is decideble iff L is recursive enumerable and L' is also recursive enumerable".
or
"a language L' is decidable iff L' is recursive enumerable and L is also recursive enumerable".
So, L and L' are recursive.