A FSA has the following transition function:

$\{0->1($a$),0->2($b$),0->3(</>),$

$1->2($b$),1->3(</>),1->4($a$),$

$2->1($a$),2->3(</>),2->4($b$)\}$

Knowing that the alphabet is $\{$ a$,$ b $\}($plus the end of the word $</>$ symbol$),$ the initial state is state $0,$ and the final states are states $3$ and $4,$ being the state $3$ corresponding to the acceptance of the input word, and the state $4$ the non$-$acceptance of the input word.

Which of the following statements better describes the accepted words for this automaton?

A FSA has the following transition function:

$\{0->1($a$),0->2($b$),0->3(</>),$

$1->2($b$),1->3(</>),1->4($a$),$

$2->1($a$),2->3(</>),2->4($b$)\}$

Knowing that the alphabet is $\{$ a$,$ b $\}($plus the end of the word $</>$ symbol$),$ the initial state is state $0,$ and the final states are states $3$ and $4,$ being the state $3$ corresponding to the acceptance of the input word, and the state $4$ the non$-$acceptance of the input word.

Which of the following statements better describes the accepted words for this automaton?

Only words containing both letters $"$a$"$ and $"$b$"$ are accepted.

Only words containing double letter sequences $("$aa$"$ and $"$bb$")$ are accepted.

Only words not containing double letter sequences $("$aa$"$ and $"$bb$")$ are accepted.

Only words containing letter sequences $"$ab$"$ are accepted.