ANSWER QUESTION 4!

3. [20 Points] For each of the following languages over 2-fa, b), design a DFA (a) L,-(w : w *, where w does not have bbb as a substring). (b) L2-(w : w ., where na (w) mod 3-0 and w begins with ab} c)L vwv: v,w and -2. (d) L4(a"b mn > 4) 4. [5 Points] Give a regular expression for (Li U L2)3, where L, L2, and L3 are the languages defined in question 3 above