Let $\backslash$Sigma $=\{$a$,$ b$\}.$ For the following language LA over $\backslash$Sigma $,$ construct a deterministic finite

automaton A with L$($A$)=$ LA$.$ For the automaton, give the state diagram and the formal $5-$tuple

definition of the DFA A $=($Q$,\backslash$Sigma $,\backslash$delta $,$ q$0,$ F $)$ with a transition table describing $\backslash$delta $.$

LA $=\{$w in $\backslash$Sigma $|$ w starts with an a and contains the substring abb$\}$