Build an FA that accepts the language of all words with only as or only bs in them. For example, a, aa, aaa, b, bb, bbb, etc are in the language, while null string, ab, ba, aab, aba, bab, bba, baa, etc are not in the language.

Give a regular expression for this language.