Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions:
Which one of the following Non-deterministic Finite-state Automata with -transitions accepts the set of valid identifiers? (A double-circle denotes a final state)
- A

- B

- C

- D


