Please provied detailed steps, and show clear answer for this question

Problem 2.2: [Homework: Due Weds, 31 January, 12:45] When processing a stream of symbols such as the stream of ascii symbols in source code, there is tokens. These are substrings, special sequences of symbols such as while. The stream of symbols in the source code for example needs to be recognized as a stream of tokens. This task is known as lerical analysis. Lexical analysis is a task that basic finite state machines a need to recognize rform. The NFA below recognizes - synonym nously, accepts only the three strings over the alphabet a, b, c]: ac, ab and bc. The states are named by the numbers 0, 1, 2, 3, 4 5, 6