Complete all parts of question 1

Discrete math

Due 13 September 2018 . a. Construct an NFA that will accept the language (aba, bab)" . Use the algorithm from class to find an equivalent DFA for the language of Show your work!! A simple diagram of the DFA will not be given credit. . Use the algorithm from class to either verify that your DFA is minimal, or else reduce your result by combining indistinguishable states. Again, you must show our work. Consider this NFA: Use the algorithm to construct an equivalent DFA - again, show your intermediate steps . Take the DFA from Problem 4 and see if you can reduce the number of states, using the algorithm discussed in class. Show work, as usual. a. al