Latex Automata help. Please I need Latex code. Please write Latex to draw the below diagram. I need Latex to draw below diagram

e. Consider the language L ={ w w Start with an a and has at most one b}. The language L is the intersection of two simpler languages say L and L. Now L ={ w[w starts with a}and L, ={ w w has at most one b}. Let M be the DFA(Deterministic Finite automata) that recognizes L and M, and M, be the DFAs that recognizes L and Ly. The state diagram of M, that recognizes L is as follows: a,b a b a,b The state diagram of M, that recognizes L, is as follows. 8.6. 8 a,b o Comment Step 13 OT The machine Mwill accept the input if and only if both M, and M, accept it. Because, the language L is the intersection of Land Ly. The state diagram of Mthat recognizes L is as follows. a,b 8 8. 10 a a a,b Combine some states to get more simplified form as follows: a a,b BB b a a b 40 a e. Consider the language L ={ w w Start with an a and has at most one b}. The language L is the intersection of two simpler languages say L and L. Now L ={ w[w starts with a}and L, ={ w w has at most one b}. Let M be the DFA(Deterministic Finite automata) that recognizes L and M, and M, be the DFAs that recognizes L and Ly. The state diagram of M, that recognizes L is as follows: a,b a b a,b The state diagram of M, that recognizes L, is as follows. 8.6. 8 a,b o Comment Step 13 OT The machine Mwill accept the input if and only if both M, and M, accept it. Because, the language L is the intersection of Land Ly. The state diagram of Mthat recognizes L is as follows. a,b 8 8. 10 a a a,b Combine some states to get more simplified form as follows: a a,b BB b a a b 40 a