Help me please, I don't understand, I want you to show me the transition diagram. Thank !!!!!.

Design a transition DFA for accept language L,={0,1} and The L language consists of any string with 0 is odd number and 1 is even number, The number of states is less than or equal to 4 states only. DFE Write a transition diagram to design an NFA for the accept language L where ={0,1} and language L={(01)n or (10)nn>=0} Assume that the designed NFA has only 5 states. L={(01)nor(10)nn0} Write down one benefit of using finite automata in a computer system. 3) Demonstrate an example of a finite automata implementation with a transition diagram and write a description of no more than 2 lines. Benefit: ? Description:? Draw transition diagram : ? 4) Present an idea, along with a 2-line reasoning, for the practical implementation of finite automata in computer system and show an example of the use of finite automata in line with the above idea with transition diagrams. Concept:? Draw Transition : ? 3 4x (9.) (92)