show step by step solution.

must be typed.

Problem 3 Construct Deterministic Finite State Automata for the following languages; for each one provide both the graph representation as well as the formal definition L1 = {w\w {0,1}", w starts with 1 and contains an odd number of 0} Ly = {ww {a,b,c}', w does not contain the pattern bbe} L3= {w w {1,2,3}", 34) L-{ ww {0,1}', the characters in the odd positions of w are all o'} Ls = {ww {a,b,c}", w contains at most four ''}