Consider the following language $L_1$ :

$L_1=\{\begin{array}{cc}w|win\{0,& 1{\}}^{*}\end{array}$ and $w$ begins with $01$ and $w$ ends with $11$ and $w$ contains $an$ odd number $of0s\}$

Draw a DFA $DF{A}_1$ that accepts the language $L_1.$

I previously had an expert look at this, but the DFA they gave me was also incorrect. The DFA they gave me didn't show $"011"$ as being accepted, but it is$.$ The handwritten DFA I attached is my incorrect DFA $($as it accepts an even # of $0$s$)$ and the typed DFA attached $(3$rd photo$)$ is the DFA the Chegg expert gave me$,$ which doesn't accept $"011".$

Please also give a brief explanation of what each state means $($i$.$e$.$ "State A is a start state that cannot be revisted during the processing of the string, State B means the input string begins with a $0$ and ensures the string begins with $01,$ etc.$)$ so that I can better understand as well.