b$)(5$ points$)$ Is this form of automaton $($a finite state machine extended with actions A$,$ E$,$ and T$)$ powerful enough to implement any lexical specification given by regular expressions? Ignore error recovery, and justify your answer.