Please solve question number 03 only from the attached picture. Thanks a lot in advance. Kindly solve within 50 minutes.
1. You need to add at least two more states and at least 3 more transitions on top of the following e-NFA to construct a new-NFA. Now, find ĆĀµ-closure(A, B) and ĆĀµ-closure(E, F) from your constructed NFA. Then use subset construction method to convert your constructed e-NFA to an equivalent DFA.
0
3
0
0
0
2. You need to construct a DFA that includes at least 10 states, each of which has exactly two outgoing transitions with input symbols 0 and 1. Now, use the table filling method to minimize the constructed DFA.
3. Now, you need to take a string having length 6 or more, then check whether this string is accepted or not in the minimized DFA of Question 2 by using the extended transition function. Your string should only contain 0's and 1's.