For S = {a, b}, construct dfa’s that accept the sets consistingof (d) all strings with at least one

For Σ = {a, b}, construct dfa’s that accept the sets consistingof (d) all strings with at least one b and exactly two a’s. (e) all strings with exactly two a’s and more than three b’s * Provide input to thoroughly test the DFA’s. . . .