Let the alphabet $\backslash$Sigma $=\{$a$,$ b$\}.$ Given the regular expression r $=$ ab$($a$+$b$)*$b$,$ assume a language L$($r$)$

is the language defined by the regular language r$.$ Explain in English, what accepted strings in the language

are like.

$2.[15$ pts$]$ Design and draw the state transition diagram of a finite automaton $($FA$)$ for the regular

language in question $1,$ above $[$Note: You$$re not drawing a transition graph, but a finite

automaton$$s state transition diagram$].$