Encode the machine to render a digital image of the state diagram.

1. Consider the following deterministic finite automaton. (a) Give the language accepted by this DFA. (Emulate the way we express languages as sets below. Use a formal universe-constraint style.) (b) Define the 5 components of the DFA quintet (Q,,,q0,F) for this machine. Q,, and F should be sets. Specify the transition function by enumerating its behaviour on all inputs (e.g., ( foo, bar )= qux ). (c) Encode this machine in our file format