HQ6 [2 pages] Let N1= and N2= be two NFAs accepting languages L1 and L2, respectively. (a) Show how to construct an NFA M that accepts the set of strings which are in L1 and such that none of their odd-length substrings are in L2. E.g., suppose 10101010 and 1100 are in L1 and 1010101 is in L2 but 1,0,110,100 are not in L2. Then, M should accept 1100. (b) Prove that your construction is correct.