1.this question contains two independent part.

a)Given two NFAs M1 and M2, show how you will construct an NFA M such that L(M) = L(M1) L(M2).

b)for the following languages over the alphabet = {a, b}, give a DFA that recognizes that language

L3 consists of strings in which every odd position contains b