can someone please help me on these questions?

Do your own work; this is not a team assignment. Due in Moodle before 10 p.m. on Sunday, February 23, 2020. (1) For 2 - {a,b), construct regular expressions that generate the following 4 sets: (A) All strings with exactly one a. (B) All strings of even length. (C) All strings of length greater than 5. (D) All strings with exactly two a's and more than three b's. (2) Give dfa's for the following two languages: (A) L = ab+wb: we {a,b)} (B) L2 = {W abbwz: W1, W2 (a,b)"} For the following three problems, use the JFLAP app to verify and document your solutions. Use the JFLAP print command to output your results to hand in. I will not grade handwritten solutions to these three JFLAP exercises; you must run JFLAP and print out your JFLAP simulations (i.e., traces), nfa to dfa conversion, or reduction to minimum-state dfa, in order to earn credit for these three problems below. (3) Consider the following nfa Mz over = {a,b): For each of the following five strings w, determine whether we L(M3): (A) aabbba (B) bab (C) baba (D) (E) bas (4) For the following nfa M4 over = {a,b), construct an equivalent dfa. NOTE: The symbol epsilon () in this transition diagram stands for lambda (a). (A) Using the nfa M4, show an accepting trace for each of the following 3 input strings: aa (B) aab babaa Using the equivalent dfa for Me, show the trace for each of the following 5 input strings: bb aab babaa = {a,b), find an equivalent dfa that has the (5) For the following 6-state dfa Ms over minimum number of states: bb