I really need help with my automata subject... Please if anyone knows how to write the regular languages of this problem..

the alphabet here is {a,b}

1. regular expression for w contains even number of a's and b's

2. every a is followed by b

3. palindrome: w = reverse of w

-----------thanks in advance