NFA union construction

    Below are descriptions of two NFAs N1 and N2. Convert them to an NFA recognizing L(N1) U L(N2). N1: states = {a,b,c,d} input_alphabet = {0,1} start_state = a accept_states = {a} delta = a,1 -> b; b,1 -> c; b, -> a; c,0 -> c; c, -> b; d,1 -> {b,c}; d, -> a; N2: states = {e,f,g,h} input_alphabet = {0,1} start_state = h accept_states = {e,f,g} delta = e,0 -> {f,g}; e, -> {e,h}; f,0 -> g; f, -> g; g,1 -> {f,h}; g, -> e; h,0 -> {g,h};