The following state table describes a finite automaton. The automaton initially begins in state 1. State 5 is the only accepting state. Entries labelled with an 'E' are errors (i.e. there is no valid transition on that input). state\input a b c d E E 3 4 E 1 E 4 2 E 5 E 5 EEE E E 5 E Which of the following is true of the strings accepted by this automaton? [Choose all that apply] There is at most one b in any given string of this language. bis always preceded by a in this language. Strings must have an even number of c's. There is at most one d in any given string of this language. Strings can have any number (including 0) of a's. The number of length 2 strings this language contains is 2