$3$ Finite State Automaton $($FSA$)$

$($a$)$ Specify a minimal DFA using a transition diagram and a formal FSA specification that recognizes the following language: "All strings of $0\text{'}$s and $1\text{'}$s that contain an odd number of $0\text{'}$s and any number of $1\text{'}$s$."$

$($b$)$ Specify a minimal DFA using a transition diagram and a formal FSA specification that recognizes the following language: "All strings of $0\text{'}$s and $1\text{'}$s that, when interpreted as a binary number, its value modulo $3=2."$