1. Write a regular expression for each of the following languages over {a,b}:
   • String of a's and b's that begin with a and end with b.
   • Strings that have at least two a's.
   • Strings that have an even number of a's.
   • Strings that do not have two a's in a row.
   • Strings that do not end with the substring ab.