yeah i mean to say b, edited my comment as well.
Given a Language L, and its complement L' is recursive enumerable.
Case 1 : Suppose L is recursive, and recursive languages are closed under complementation, so L' is also recursive, now every recursive language is also, recursive enumerable, so we can say its satisfy our condition, which is option b.
Case 2 : Either one of L or L' is not recursive, that means its recursive enumerable, and recursive enumerable lanugages are not closed under complementation, so we can't say for sure that complement is recursive enumerable. This case is not possible.