0 0 q2 9 Figure I: The NFA N, where e repre- sent the empty string Apply the techniques in the proof of Theorem 1.45 (Sipser) to convert the NFA Ne to an equivalent DFA De. Your answer should provide, for the DFA De, a finite state diagram where all the states, the starting state, all of the accepting states and all the transitions (with the corresponding labels) are displayed/drawn clearly. Show intermediate steps