Theory, automata

Give a machine that recognizes the following language and a regular expression that expresses it:

{w | w is any number of occurences of 'ab'.} ={a,b} (Ex: , ab, abab, ababab, ...)