You are given 2 NFAs N1 = (Q1, 2, 81, q10, F1) and N2 = (Q2, 2, 82,920, F2). Con- struct an NFA N = (Q, 2, 8, 90, F) recognizing L(N1) L(N2). One solution would be to find DFAs equivalent to Ni and N2, followed by a known construction for a DFA recognizing the intersection. If Q1] = k and Q2] = k2 then such a DFA would have up to 2ki+k2 states. We want to be much more efficient. (a) Find a solution N with much fewer states. (b) How many states has your NFA N? You are given 2 NFAs N1 = (Q1, 2, 81, q10, F1) and N2 = (Q2, 2, 82,920, F2). Con- struct an NFA N = (Q, 2, 8, 90, F) recognizing L(N1) L(N2). One solution would be to find DFAs equivalent to Ni and N2, followed by a known construction for a DFA recognizing the intersection. If Q1] = k and Q2] = k2 then such a DFA would have up to 2ki+k2 states. We want to be much more efficient. (a) Find a solution N with much fewer states. (b) How many states has your NFA N