Answer all the questions. Unless otherwise stated, all the DFAs and NFAs in this homework uses = {0,1} as the alphabet. 1. (10 point) Construct a NFA N1 so that L(Ni) = {ww has an even number of 1's or, contains exactly three O's.}. 2. (10 point) Construct a NFA N2 so that L(N2) = {w/w is a binary string except that it is not the empty string nor the string 001.}