For each of the following languages draw the state diagrams of DFA's that accepts languages over the alphabet = {0, 1}

(a) L1 = {w{0,1}* w does not contain the string 1101 as a substring}.Your DFA must have exactly 5 states.

(b) L2 = { w * where each 0 in w followed by exactly one or three 1's }. Your DFA must have exactly 6 states.

(c) L3 = Let D = {w | w contains an even number of '0's and an odd number of '1's and does not contain the substring 01}. Your DFA must have exactly 5 states.