The digraph shown represents a finite state machine (FSM), with starting state A. Which of he following best describes the strings of characters that the FSM generates when executed?

all strings comprising characters "a" and "b" in any combinations

all strings of "b" chars beginning or ending with "aa"

all strings ending in "aa"

"aab" or "baa"

all strings that start "aa" then have one or more "b" chars and ending in "a"