(a) (2 marks) Draw the state diagram for a DFA recognizing language Li = { x contains at least three b's). (b) (2 marks) Draw the state diagram for a DFA recognizing language L2 = {x | starts with an a and contains at most one (c) (4 marks) Draw the state diagram for a DFA recognizing language L3 = L1 U L2. Hint: One option is to use the construction of Theorem 1.25 in the text. (d) (4 marks) Draw the state diagram for a NFA recognizing language L3 = LIU L2. (a) (2 marks) Draw the state diagram for a DFA recognizing language Li = { x contains at least three b's). (b) (2 marks) Draw the state diagram for a DFA recognizing language L2 = {x | starts with an a and contains at most one (c) (4 marks) Draw the state diagram for a DFA recognizing language L3 = L1 U L2. Hint: One option is to use the construction of Theorem 1.25 in the text. (d) (4 marks) Draw the state diagram for a NFA recognizing language L3 = LIU L2