NFA concatentation construction

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