Draw the state diagram and then encode the machine to render a digital image of the state diagram.

2. Build a deterministic finite automaton that accepts the language {w{a,b}:w ends with ab}. (a) Draw the state diagram. Use states numbered 1 through n, with the start state 1. (b) Encode the machine in our file format