Automata theory explanation: Questions 1-2 only please with explanation

1. Consider the following languages over {0, 1}: 5. Give the state diagrams of DFAs recognizing the following languages over { = {0,1}: a. Lo b. La C. {, 1, 001} Li= {w: w contains more O's than 1's and w5} a) Li b) L2 c) Liv L2 d) Li L2 2. Consider the following languages over {0, 1}: L3= {w: contains at most two l's and W=3} L4= {w: w=wW S3} Enumerate the first 7 strings in the L-ordering of the following: a) L3 b) L4 c) L3-L4 d) L4-L3 3. Using the languages L3 and L4 from the previous problem, enumerate the first 7 strings in the L-ordering of the following: a) L3L4 b) L4L3 c) L33 d) L4 4. What are the unique substrings of w = bcbbac over 2 = {a, b, c)? 1. Consider the following languages over {0, 1}: 5. Give the state diagrams of DFAs recognizing the following languages over { = {0,1}: a. Lo b. La C. {, 1, 001} Li= {w: w contains more O's than 1's and w5} a) Li b) L2 c) Liv L2 d) Li L2 2. Consider the following languages over {0, 1}: L3= {w: contains at most two l's and W=3} L4= {w: w=wW S3} Enumerate the first 7 strings in the L-ordering of the following: a) L3 b) L4 c) L3-L4 d) L4-L3 3. Using the languages L3 and L4 from the previous problem, enumerate the first 7 strings in the L-ordering of the following: a) L3L4 b) L4L3 c) L33 d) L4 4. What are the unique substrings of w = bcbbac over 2 = {a, b, c)