Formal Language and Automata Theory

36 For 2 = {0,6), construct dfa's that accept the sets consisting of all strings with exactly one a, all strings with at least one a, 4) ali strings with no more than three a's, td) all strings with at least one a and exactly two b's, (e) all the strings with exactly two a's and more than two b's