Here is a question about finite state machine. Please provide your full explanations and I really appreciate your help!!

(Note: DFA stands for deterministic finite automaton(symbol: M). M is a 5-tuple M=(Q,,,q0,F), where

Q is a finite set, called the set of states of M;

is a finite set called the alphabet of M (elements of are called characters)

is a function :QQ, called the transition function. In the picture, there is a transition from q to q on input a if (q,a)=q.

q0Q is the start state

FQ is the set of final states)

QUESTION STARTS BELOW:

(Finite automata will be covered Monday) For each of the following languages L, give a DFA M with L(M) L. Be sure to describe each state carefully (e.g. strings of even length end in state q1 (a) Strings in 0, with at most three 0's. (b) 1010, 011, 1,00 (c) Strings in 10,1)" where every 1 is followed by a 0