Give regular expressions that generate each of the following languages. In all cases, the alphabet is = {a, b}.

(a) The language {w|w contains at least two bs, or exactly two as }

(b) The language {w|w contains exactly one double letter }. A double letter is either aa or bb. For example, baaba has exactly one double letter, but baaaba has two double letters.