Please include diagram

- Consider the following grammar for a simple programming language: s tmt >::=assignStmt assignstmt ::=id=expr; printstmt> ::= print ; id ::= letter id letter letter> : := abcdefghij klmmprss number ::= digit digit addOp::=+1 multop ::=/ - Using Finite State Machine Designer , create a DFA that will recognize all tokens in this grammar. - Do the following steps: - identify tokens in the language over this grammar - write regular expressions for each of the tokens - transition each regular expression to NFA - start with primitive automata and use the rules from the lecture to create the complete DFA