1. For = { a, b }. Draw a DFA that accepts the language L, where L = { w * | na(w) <= 3 }. In other words, L is the set of strings containing at most three as.

2. 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.

Thanks a lot for your help!!!