Please HelpAnswer all the question

Need draw the graph

L={ww has neither aa nop the language, alphabet {a,b} [5 points] Let Machine M:({q0,q1,q2,q3},{a,b},q0,q1,) where transition is given by (q0,a)=q1,(q1,a)=q3,(q2,a)=q2,(q3,a)=q2;(q0,b)=q2,(q1,b)=q0,(q2,b)=q2, (q3,b)=q2 a. Represent M by its state table b. Represent M by its state diagram c. Which of the following strings are accepted by M ababa, aabba. [5 points] Design a FA over {a,b} accepting the strings where number of a's are divisible by 2 and number of b 's are divisible by 3 . [5 points] Design DFA to accept the language, alphabet {a,b} L={ww has neither aa nor bb as a substring } [5 points] Let Machine M: ({q0,q1,q2,q3},{a,b},q0,q1,) where transition is given by (q0,a)=q1,(q1,a)=q3,(q2,a)=q2,(q3,a)=q2;(q0,b)=q2,(q1,b)=q0,(q2,b)=q2, (q3,b)=q2. a. Represent M by its state table b. Represent M by its state diagram c. Which of the following strings are accepted by M ababa, aabba. [5 points] Design a FA over {a,b} accepting the strings where number of a's are divisible by 2 and number of b's are divisible by 3