Draw the DFA that is described by the formal definition: ({90, 91, 92, 93, 94}, {0, 1, 2}, 6, 90, {90}) with d defined by and 8(qi, 0) = qir 8(qi, 1) = = 9(i+1 mod 5), 8(qi, 2) = 9(i-1 mod 5) (a) Draw the state diagram of your DFA in JFLAP, export the image as a png or jpg file, and include it as part of your submission. (b) Describe the language recognized by this DFA. (c) * Is it possible to construct a DFA that recognizes this language with fewer states? If not, explain why not. If so, then draw it using JFLAP. What if we took a NFA instead of a DFA? lows Go to Settings to activate Windows.