Question Need help with formal language and automata Design

Question: Need help with formal language and automata:

Design a Turing machine with no more than three states that accepts the language L (a (a + b)*). Assume that sigma = {a, b}. Is it possible to do this with a two-state machine?

Solution

Answer:

yes it\'s possible ,

just make one state i.e non final then on a input make transition to final state