Hello, I'm a beginner in formal languages, I'm not sure how to start the exercises below:

1. Give AFD (deterministic) state diagrams that recognize languages ??to follow. Do not forget to mark who the initial state is and who the final states are. In all cases the alphabet is {0,1}:

{w | every even position of w is 0} {w | the length of w is 4}.

{w | w is any string except 01 and 101}. {w | w contains an even number of 0's or contains exactly three 1's}

Give AFNs state diagrams (non-deterministic) by recognizing each of the

 following languages. Do not forget to mark who the initial state is and who the final states. For items a and b, the alphabet is {0,1}.

{w | w contains substring 11011}. The AFN must contain 6 states.

{w | w contains an even number of 1's or contains exactly two 0's}. The AFN must contain 6 states. The set of words on the alphabet {a, b, c, d, e} such that the last symbol of the word has not appeared before in it.

The. {w | every even position of w is 0} B. {w | the length of w is 4}. w. {w | w is any string except 01 and 101}. d. {w | w contains an even number of 0's or contains exactly three 1's}