True or False

Question 2 Given is an automaton with epsilon-moves. Use the method based on computing epsilon-Closures and create an equivalent nondeterministic finite automaton, and then deterministic finite automaton. Next, answer the following questions. 0 1 90 91 92 93 91 94 94 92 93 94 0 93 91 0 94 0 A 0 True False There are at least two accepting states in the nondeterministic finite automaton In the deterministic finite automaton, there are three accepting states. The wider epsilon-Closure consists of three states. The minimal deterministic finite automaton has 7 states