Concept:
In computation and lexical analysis, a problem is first defined, then patterns are written using regular expressions, then automata are constructed and finally tokens are generated.
Step 1: Problem.
First, the computational problem is identified.
\[
\text{First step}=D
\]
Step 2: Regular Expression.
The required pattern is expressed using regular expression.
\[
\text{Second step}=A
\]
Step 3: NFA.
The regular expression is converted into NFA.
\[
\text{Third step}=B
\]
Step 4: DFA.
NFA is converted into DFA for deterministic processing.
\[
\text{Fourth step}=E
\]
Step 5: Tokens.
Finally, tokens are generated or recognized.
\[
\text{Fifth step}=C
\]
\[
\therefore \text{Correct Answer is (B)}
\]