AL Design a DFA for each of the following languages under the alphabet -(0, 1]. . aldfaliff = { w I 00 is not a substring of w} .a1dfa2.jff wne ther 00 nor 000 is a substring ofw . a1dfa3,jffne ther 00 nor 010 is a substing of w * a1 dra4.jrr = { w l nether oo nor 0100 is a substring or wr} a1 dras.Jt1: neither ooo nor 01 Is a substring at w } Implement each in JFLAP and uploed the five corresponding JFLAP files using the specified fileiames (a1dfa1.jf, a1dfa2 jff, etc.). Consider whether any of these languages are equivalent and separate these languages into groups (sets) that accept the same language. Use Online Text to indicate the groupings as equivalence sets; Tor example: 1la.jt, 1ic) 1b.jt) 1id.ji, 1e.i) A2. Convert the following NFA into a DFA q2 Implement the DFA using JFLAP and upload the DFA as a e named a2dta.jm Finite automata are use equlvalent DFA. 1 oomponents ot computers and algorithms, thus it is important to be able to minimize the number of states or a given DFA Convert the following DFA to a minimum-state q2 q3 q8 95 q6 Implernent the minirnized DFA using JFLAP and upload that DFA as a file named a3mindfa.jff A4. Consider the following regular gramiar with start syrnbol S and terminals x, y Using Onine Text... A4a. List four strings, each of length less than 4, accepted by this grammar. (nclude s if it is accepted.) 4b. Lst tour strings, each of length less than 4, not acoepted by this grammar.(nclude c f it is not accepted.) A40. In English, describe the language represented by this grammar