I have to draw a finite automaton of a language over $\{a,b\}$ of all strings having odd length and has an even number of $b$s.
I already came up with following regular expression $(a+b)((a+b)(a+b))^*$ which satisfies the condition that a string must have odd length.
What should it look like so that a string has even number of $b$s as well?