Consider the language defined below, letter = a b c d e f g h digit = 0|1|2|3|41516171819 tri = Og.(letter digit). (letter digit).(letter digit) number = digit* keyword = (afehde) id = letter.(letter digit)* Which of the following strings are in this language? Og000 Oh000 a abc Og56t Og45 ehde If we have a lexer which implements this language, what set of tokens will be output for a string 'afgafg667' show your workings. Draw a finite state machine which recognizes the 'id' token of this language