3. (5 points) Give a DFA for the following language over the alphabet = {0, 1} L={ u, l every odd position in u, (if the position exists) is a 1 . Assume string positions are indexed from i. For example, the string 1011101 L but the string 1001 L