(b), (c) and (d) are true. But the strongest answer would be (d) a regular language. It is trivial to say that a finite set of strings (finite language) can be accepted using a finite set of states. And regular language context-free context-sensitive Turing recognizable, would imply that regular language is the strongest answer.
I am also facing the same problem my ...