i wanted to ask u if someone can help me to construct a Regular Expression over the alphabet (a,b,x), constituted by all strings containing an odd number of a's, and in which between each pair of consecutive a's there is an even number of b's (and an arbirtary number of x's). E.g., babbxbbxabbxaabxxbax E L(A), bab E L(A), while abba NOT E L(A) and abbbaa NOT E L(A).

What is the approach?

I wanted to ask if someone can help me to construct a regular expression over the alphabet $\{a,b,x\}$ for the language $L$ which is constituted by all strings containing an odd number of $a$'s, and in which between each pair of consecutive $a$'s there is an even number of $b$'s (and an arbirtary number of $x$'s).

For example, $babbxbbxabbxaabxxbax \in L$, $bab \in L$, while $abba \notin L$ and $abbbaa \notin L$.

What is the approach?