A2. Convert the following NFA into a DFA q1 92 Implement the DFA using JFLAP and upload the DFA as a fle named a2dfa.jff A3. Finite automata are useful components cf computers and algorithms, thus it is important to be able to minimize the nunber of states f a iven DFA Convert the followwig DFA to a rminimum-state equivalent DFA. q2 q3 q8 q4 q5 q6 q7 Irmplement the minimized DFA using JFLAP and upload that DFA as a file named a3mindfa.jff AA Consider tho following regular grammar with start symbol S and terminals Using Online Text... A4a. List four strings, each of length less than 4, accepted by this grammar. (Include e ifit is accepled.) A4b. List tour strings, cngth less than 4, not accepted by this grammar.Indde c It t is not accepted. A4C. In English, describe the language represented by this grammar