title: Finite Automata string not ending with ba
body: <p>Question:  Build an FA that accepts only those words that do not end with ba.
  I want to Draw DFA for this problem but I don't understand I to do it please help me to draw this</p>