Apply the techniques in the proof to convert the NFA N_c to an equivalent DFA D_c. Your answer should provide, for the DFA D_c, 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.

Figure 1: The NFA Nc, where e represent the empty string Apply the techniques in the proof of Theorem 1.45 (Sipser) to convert the NFA Nc to an equivalent DFA Dc. Your answer should provide, for the DFA Dc, 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