Our alphabet is {a, b}. Construct a DFA that accepts all strings that has an odd number of as and each a is followed by at least one b. Design a DFA that recognizes the following language: L = { w Element {0, 1}* | all binary strings that end with 10} Design a DFA that recognizes the following language: L = { w Element {a, b} * | w starts with an a and has at most one b} Design an DFA that recognizes L= {w Element {a, b}* | w has at least 3 as Union w has at least 3 bs}