Answer to problem #1 https://www.chegg.com/homework-help/questions-and-answers/regular-expressionl-1-30-pts-construct-nfa-equivalent-following-2-25-pts-following-strings-q27152521

(40 pts) Convert the NFA from problem #1 into a corresponding DFA using the algorithm you learned in class. Make sure to show your work and draw the constructed DFA. In addition, be sure to identify start and final states. (25 pts.) Prove that a language L = {ba*bbb*a,babf.bba*) * is regular 5. (25 pts) Is the language in problem #4 equivalent to the language L' ((b(a + b))*? Prove your