So i need help on number 1 of the first image which points to Figure 2.10 in the second image.

This gives us the new state (0)YiW2) 1, i = 0, j = 1, k-2, Then, using a makes it necessary to introduce yet another state,92). At this point, we have the partially constructed automaton shown in Fig. re 2.15. Since there are still some missing edges, we continue until we obtain the complete solution in Figure 2.16. One important conclusion we can draw from Theorem 2.2 is that language accepted by an nfa is regular. every EXERCISES 1. Use the coustruction of Theorem 2.2 to convert the nfa in Figure 2.10 to a dfa. Can you see a simpler answer more directly? 2. Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa. 3. Convert the nfa defined by with initial state go and final state g2 into an equivalent dfa. 4. Convert the nfa defined by 6(q2 , a) = {92} 6(go,A) = {ga) with initial state go and final state ga into an equivalent dfa. 5. Convert the nfa defined by 6(qi, b) = (a,p) 6(q2, a) = {ga} with initial state go and final state q into an equivalent dfa