Graphic Anwer should be write down on paper with a very CLEAR handwriting, and please explain the step. only the question b d in Q1.

Q1- Design a DFA for each of the following a) All words on ={a,b} that the last two letters are different. Example: aabba,abbab b) All words on ={a,b,c} that (na(w)+2nb(w)nc(w))mod9=2. c) All words on ={0,1} that the remainder of the represented binary number by 8 is 5 . d) All words on ={a,b,c} that between each two substrings 'ab', we have a substring 'bc'. Example: bbabaabcbbabcc, abbcab Q2- Convert to the following regular expressions to an NFA. a) a(a+b)b+b(a+b)a b) b(abb+aabb)(+a+aa) Q3- Convert the following NFA to an equivalent DFA, then convert the DFA into a regular grammar