3. (5 points) Give a DFA for the following language over the alphabet = {0, 1): L={ w I every odd position in w (if the position exists) Is a 1 } . Assume string positions are indexed from 1 . For example, the string 1011 101 E L but the string 1001 L