Formal Languages & Automata, Finite Acceptors

Consider the DFA M described by the transition table below. The start state is 0 and the final states are 1 and 2. Draw a diagram of M. Describe the language accepted by M using a set constructor. Prove that L = L(M).

q	0	1	2
a	1	2	0
b	0	1	2