Construct a NFA N$3$ that recognizes the language L$($N$1)$ L$($N$2).$ Use the Grafstate Simulator to show $2$ strings that are accepted by N$3$ and $2$ strings that are rejected by N$3.$