2. Build a FA that accepts the language of strings, over alphabet (a, b), that start with a followed by a or with b followed by b and that end with b