1. For each of the following languages state a regular expression which denotes that language. a. L is the set of strings over {0,1} that contain at least one 1 and do not end with 1. b. L is the set of strings over {a,b} that contains the substring bbb exactly once. 2. Let = {a,b} for this problem.. and o a. Give a finite automaton M that accepts all even length strings. b. Give a finite automaton M2 that accepts all strings with an odd number of a's. c. For the finite automata M given in Part a and M2 given in Part b contruct an automaton that recognizes the language L(M1) AL(M2). TYTT