Design Non-Deterministic Finite Automata 1

We can design the NFA with 3 states and the rule is: the string that can be received must end in 'ab'.
Examples of strings that can be accepted: 

• 'ab', 
• 'aab', 
• 'a * ab', 
• 'bab',
• 'b * ab', 
• 'abab', 
• 'a * b * ab', 
• 'b * a * ab '

The  Answer: 

 

Design the NFA