You are given 2 NFAs N = (Q, E, 61, 910, F1) and N = (Q2, E, 62, 920, F2). Con- struct an NFA N = (Q, E, 6, qo, F) recognizing L(N) L(N). One solution would be to find DFAs equivalent to N and N, followed by a known construction for a DFA recognizing the intersection. If |Q = k and Q2| = k2 then such a DFA would have up to 2k1+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?