Problem
1. Write lax program for the tokens of the grammar. Verb → is | am | was | do | does | has | have
2. Identify the main token types in this expressionx = 3 + y * 5
3. Explain the requirements and routines for lexical analysis to perform its task
4. Give the minimized DFA for the following expression (a/b)*abb.