$2.$ Please draw the state diagram for a DFA that recognizes the language C $=\{$w $|$ the $1$st letter of w is a$,$ and the last letter of w is b$\}$; here, the alphabet of the language is $\{$a$,$ b$\}.$

Also, write the regular expression that represents C$.$

$(20$ points$)$