Convert the following NFA to a DFA that decides the same language: Use the construction discussed in class. You do not need to provide a graphical representation of the constructed DFA. Do provide the tabular representation of the DFA, representing each state as the corresponding set of NFA states, marking the start state with an arrow, and marking each accepting state with an asterisk (), exactly as I did on the slide showing the construction. Use the method discussed in class to convert the NFA in Question 1 into a regular expression that matches exactly the strings accepted by this NFA. You should show the RNFA you obtain from the given NFA, as well as the individual steps that remove one state at a time until you obtain an RNFA with two states and a single transition whose label is the desired regular expression