Consider the grammar with alphabet a and b that generates all strings with even number of as: (b*ab*a)*b*

Give a regular expression to generate all possible strings over alphabet a and b in which the number of as is multiple of four.