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?

I want to write a regular expression to recognize the set of strings over {a,b} having odd number of a’s and b’s and that starts with ‘a’.