Please answer in $1$ hours need it DFAs

For each of the following sets, draw a transition diagram for a deterministic finite automaton $($DFA$).$

This means you should:

Draw a node for each state.

Indicate the start state with an incoming arrow.

Indicate the final $($a$.$k$.$a$.$ accepting$)$ states with double circles.

Make sure that for each state and for each symbol in the alphabet, there is exactly one arrow

leaving that state that is labeled with the symbol. $($I$.$e$.,$ you can always tell what the next

state is$.)$

Note that the DFA must accept all strings in the set. Furthermore, for every string that is not an

element of the set, the DFA must not accept.

is a string over $\{a,b\},$ has an even number of a $\text{'}$s and ends with b