I have a question in my exam about Automata:
“Let L be a language of symmetric words created by the alphabet Σ = {a, b}, the language expressed by which expression below contain words in language L?

A. (a*+b*)*

B. a* b* b* a*

C. (baab)*

D. All answers are wrong.”

I think the answer is C since we have words such as: baab, baabbaab, baabbaabbaab, … these are all symmetric words – reading from left to right is the same as reading right to left. But in the answer sheet of my teacher, he chose A as the correct answer. Did he give wrong answer? Thank you