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

b. Consider the language L ={ ww has at exactly two a's and at least two b's}. The language Lis the intersection of two simpler languages say L and L. Now L ={ ww has exactly two a's} and L2 = { ww has at least two b's). Let Mbe the DFA(Deterministic Finite automata) that recognizes L and M, and M, be the DFAs that recognizes L and L. The state diagram of M, that recognizes L is as follows b b b a, b a The state diagram of M, that recognizes L, is as follows a,b 8.8.8 The machine Mwill accept the input if and only if both M, and M, accept it. Because, the language L is the intersection of L and Ly. The state diagram of Mthat recognizes L is as follows: a a a b b a a b b b a a,b b b b Combine some states to get more simplified form as follows: Comment Step 5 of 18 a a a a a,b &o b b b