Theory of computation: DFA and NFA

These are practice problems that I dont understand please help me answer them while still explaining how you got your answer. I appreciate it

1. Consider the NFA (over the alphabet (0,1)). o, E. Which of these strings can the NFA accept? a. 00 b. 01001 c. 10010 d. 000 e. 0000 2. Can you describe the language accepted by this NFA (with [a, b))? lb to 21 3 CS290 Practice with Nondeterministic Finite Automata For the NFA given below (over the alphabet -[a) 3. a. a. What strings can this NFA accept? b. Find a DFA (Deterministic Finite Automaton) that accepts the same language CS290 Practice with Nondeterministic Finite Automata 4. Design an NFA that accepts the language (a) u (ab)-e, a,aa, aaa, aaaa,. ,U (ab) 5. Can you create a DFA that accepts that same language? CS290 Practice with Nondeterministic Finite Automata is removed NFA that accepts (al and is such that if in its state diagram a single edge 6. Find an (without any other changes), the resulting automaton accepts (a) Can the previous exercise be solved using a DFA? If yes, give an example; if no, give a convincing argument for your conclusion. 7