Consider the following language. L=(w (0.1): w starts with an even number of 1s) (a) Write down a string that is in L. (b) Give the state diagram for a DFA that recognizes L. Problem 2: Kleene Closure (3 points) Let L= (111,11111). Write down all the strings w of length at most 10 such that we {1} but wg L".