i. Consider the following 5-tuple definition of a DFA: D=(Q, 2, 8,90, F), where o Q = {90, 91, 92, 93}, ο Σ = {r, s}, o is defined as follows: qk+1 8(qk, a) -.- ak if a =r and k +3 if a=r and k=3 otherwise 90 o F= {q0, 91, 92} Piece this apart one step at a time. How many states does this DFA have? Which one is the start state? What is the alphabet, and how many characters are in it? Which states are accepting/? The trickiest part is decoding the transitions. Begin with the start state. Pick any character you want. Where do you go when you see that character? See if you can take things from there. Once you're done, a good question to ponder but not submit: what is the language of this DFA? ii. Consider the following 5-tuple definition of a DFA: D= (Q, 8, 8, 90, F), where O Q = {90, 91, 92}, ο Σ = {r, s}, o is defined as follows: 8(qk, a) if a=r 9322_Jk+4 9–3x2 +5k+2 if a =s o F = {qo}