The conditional definitions of the following tokens are given using regular expressions.

In addition, it is a given that the alphabet also includes the symbols c and d $($in addition to a and b$).$

Token$1$: a$($a $|$ b$)+$a

Token$2$: $($ab$)+$a

A$.$ Build a deterministic finite state automaton $($with the possibility of "getting stuck"$)$ with a limited commonality

Especially for identifying the $1$Token and $2-$Token tokens.

Indicate next to each receiving state of the automaton which token will be accepted in that state.

List all the ins and outs of the calculation. $)$ joint non$-$deterministic automaton, finite automaton

Considerable deterministic, limited automaton with the possibility of getting stuck.

B$.$ Is there an input string that will cause the output to return $1$Token $2$Token $1$Token?

If so$,$ give an example of such a string.

If not, explain well why not.

third. Construct one transition diagram, which will match the patterns of the two tokens.

d$.$ From the transition diagram you built, build a code segment for a suitable lexical analyzer