Construct a DFA for the set of strings of length 2 or more over {a,b} whose second-to-last symbol is 'a'. For each state in your DFA, explicitly state what set of strings terminate at that state. (Strong Suggestion: Think about what information you need to remember about the first portion of a string so that you can determine if the string should be accepted given the last portion. This will tell you what you need for each state in the DFA.)