Question: Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is $\{0,1\}.$ a$)\{$w$|$ w contains the substring $0101($i$.$e$.,$ w $=$ x$0101$y for some x and y$)\}$Give state diagrams of DFAs recognizing the following languages. In all parts, the

alphabet is $=\{0,1\}.$

$($a$)$ begins with $1$ and ends with $0$