Please Help answer all the question

[5 points] Test whether the following strings are accepted by the following automata or not: denotes start state, denotes Final State. (i) 101101 (ii) 11111 (iii) 1110011. [5 points] Design DFA to accept the language, with alphabet {0,1} L={ww has atleast length three and its third symbol is always a 0} L={ww has neither aa nopt 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. 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