10. (30pts) Consider the languages L1 = {x {0,1}* | * contains at least two Os } and L2 = {x {0,1}* | x contains an odd number of ls } . Give the state diagram for a DFA that recognizes Ll. There should be no more than three states. Label them 1, 2 and 3. Give the state diagram for a DFA that recognizes L2. There should be no more than two states. Label them A and B. Use the product construction to build a DFA that recognizes the intersection of languages Li and L2. Clearly show you are using the product construction. You must show all the states but you do not have to show the transition arrows for states that are not reachable