Create and implement a lexical analyzer for C-- as follows:
1. Write the set of token types to be returned by lexical analyzer.
2. Explain regular expressions for this set of token types.
3. Deduce the single DFA from the regular expressions.
4. Implement DFA using any software you like (recommend in C program). You must implement lexical analyzer program as implementation of DFA where each state in DFA is separate function.