Consider the following DFA over the alphabet $=\{0,1\}$ : a$)$ What is the language recognized by this DFA? b$.)$ For a string w$,$ let w$^$R denote the reverse of w$,$ i$.$e$.,$ the same string written in reverse order. For instance, if w $=11101010$ then w $^$R $=01010111.$ Let L denote the language L $=\{$w in $\backslash$Sigma $|$ w R is accepted by the DFA from part a$\}.$

Give a DFA for L and explain why it works. Try to use as few states as possible