Homework Help

For each part below, give the formal definition and state diagram for a deterministic finite automaton (DFA) that accepts the language specified.