Consider a language similar to markup languages. Text is annotated by tags that are in the form text/ The label and following words are composed of letters. There is always a label with zero to many words following. Note that the end of the text impacted by the tag is indicated by a single slash (no and/ Valid string of the language: Start with text. The scanner makes a list of tokens. No syntax checking. The tokens should be: Start with text. important stuff The scanner makes a list of bold tokens. No syntax checking. Invalid strings: This string junk has a missing right bracket This string has a The slash is not inside brackets. 1. [25 points) Draw circle and arrow graph showing a deterministic Finite State Automata (FSA) for a scanner that creates tokens for the markup language. Transitions between states are based on individual characters. This should be a Mealy machine that takes actions at the state transitions. Number the states from 1 to as large as needed. Consider a language similar to markup languages. Text is annotated by tags that are in the form text/ The label and following words are composed of letters. There is always a label with zero to many words following. Note that the end of the text impacted by the tag is indicated by a single slash (no and/ Valid string of the language: Start with text. The scanner makes a list of tokens. No syntax checking. The tokens should be: Start with text. important stuff The scanner makes a list of bold tokens. No syntax checking. Invalid strings: This string junk has a missing right bracket This string has a The slash is not inside brackets. 1. [25 points) Draw circle and arrow graph showing a deterministic Finite State Automata (FSA) for a scanner that creates tokens for the markup language. Transitions between states are based on individual characters. This should be a Mealy machine that takes actions at the state transitions. Number the states from 1 to as large as needed