Let l be a language over the alphabet å= {a, b} that contains strings over {a, b} such that each string has at least one a and every a is immediately followed by odd number (1, 3, 5, …) of bs.

e. g. ab, abab, abbb, ababbb, abbbab,… give a regular expression that describes l