Draw state diagrams of DFAs with as few states as you can recognizing the following languages. You may assume that the alphabet in each case is $\backslash$Sigma $=\{0,1\}.$

$($b$)$ L$2=\{$w $|$ w represents a binary number that is divisible by $4\}.$ The number is presented starting from the most significant bit and can have leading $0$s$.$