Consider a language that has an alphabet of {A,B}, and consists of all strings that begin with an A, end with an A and contain exactly two B's.

On a sheet of paper, draw a finite state automata that accepts all strings in this language, (all strings that begin and end with an A and contain exactly two B's). Be sure every state shows what happens when both an A and a B are input to that state. Clearly indicate the accepting state(s) with a double circle.