1. For = { a, b }. Draw a DFA that accepts the language L, where L = { w * | the second-to-the-last-letter of w equals a }. In other words, L is the set of strings where the letter that precedes the last character in the input string is the letter a. The string w must have at least 2 letters.

2. For = { a, b }. Draw a DFA that accepts the language L, where L = { w =an bm | n % 2 = 1 AND m % 2 = 1 }. In other words, the number of as and bs is both odd, but all the as must precede all the bs.

3. For = { a, b }. Draw a DFA that accepts the language L, where L = { w = bk a3n+k | k equals 0, 1 or 2, and n >= 0 }. In other words, the number of bs in the string is equal to the remainder of the (number of as in the string) divided by 3, and all the bs precede all of the as in the string.

Thanks a lot for your help!!!