2. (10 points) Consider the following DFA N over the binary alphabet, given as a transition diagram: 0 start- A B 0 1 0,1 0 1 0 D E 1 (a) Give the sequence of states (starting with A) that N goes through on input 000100. Does N accept this input? (b) Give two distinct minimum-length strings accepted by N. (c) Is L(N) infinite? Explain