Consider the Deterministic Finite-state Automaton (DFA) shown below. The DFA runs on the alphabet , and has the set of states , with being the start state and being the only final state.
Which one of the following regular expressions correctly describes the language accepted by ?

- A
- B
- C
- D

