Solve from Questions 5 - 7

Problem 1: Suppose the alphabet given is {0,1} (C= {0,1}). For the languages that are given below construct Deterministic Finite Automata. 1. L= {we [*: w begin with a 1 and ends with a 0} 2. L = {all strings with exactly three O's} 3. L= {we [*: [w]mod3 = 0} 4. L = {ab3wba: w is from {a,b} *} 5. L = {all strings with at least one a and exactly two b's} 6. L= {11, 110}* 7. L = {wee * w does not contain 110 as a substring}