The task is to design a DFA that recognizes the same language as the NFA below recognizes: The DFA below is a solution to this task (constructed using the algorithm described in the proof of Theorem 1.39): The designer of the DFA above forgot to label the states that are final states. Which one(s) should be labelled final state(s)? [We assume an alphabet consisting only of the two symbols a and b.] The designer of the DFA above forgot to label the states that are final states. Which one(s) should be labelled final state(s)? [We assume an alphabet consisting only of the two symbols a and b.] Select one: a. q1 b. q1 and q1,2 c. q2x d. q2 and q1,2 e. q1 and q2