Please give clear explanation with necessary diagrams and steps for the question

Consider the DFA M=({q0,q1,q2},{0,1},,q0,{q0}) where is defined as follows: (a) Draw a diagram to represent M. (b) Give a set-based definition of L(M) (the language recognized by M ). (Don't be a smart-aleck and write L(M)={sM recognizes s} or something like that. You need to demonstrate that you understand exactly which strings will be in that language.)