(i) (ii) (iii) What language does the following NFA represent? a a,b 90 q1 b q2 Convert formally (i.e., follow the algorithm presented in class) the NFA in (i) to an equivalent DFA. Simplify formally (i.e., follow the algorithm presented in class) the DFA in (ii) or show that it cannot be simplified.