$(10$ pts$)$ Here's a finite state recognizer:

Two symbols on a transition $(\text{'}$a c$\text{'})$ represent a disjunction $(\text{'}$a or c$\text{'}).$ Which out of the following

strings would be accepted by the FSA above?

$($a$)$ c c a

$($b$)$ b b

$($c$)$ cba

$($d$)a$ a b b b

$($e$)$ a a b b a

$($f$)($the empty string$)$