Create a DFA for the language L = {w {0,1}: w is a set of strings with odd length and n0(w) mod 3 is equal to 2}. Note: n0(w) means the number of 0s in the string w. Hint: First, create two separate DFAs for is a set of strings with odd length and n0(w) mod 3 is equal to 2. Then, create the intersection between those DFAs by using the product construction. Show all your work.

(a) (2 points) Draw a DFA M1 for is a set of strings with odd length:

(b) (3 points) Draw a DFA M2 for n0(w) mod 3 is equal to 2: (

c) (5 points) Create DFA M which is the intersection of M1 and M2 :