Consider the following deterministic finite automaton (DFA) defined over the alphabet, . Identify which of the following language(s) is/are accepted by the given DFA.


- AThe set of all strings containing an even number of 's.
- BThe set of all strings containing the pattern .
- CThe set of all strings ending with the pattern .
- DThe set of all strings not containing the pattern .

