Draw a deterministic finite accepter for the following language over$\backslash$Sigma $=\{$a$,$b$,$c$\}.$

$1)$ Strings where the number of a$$s is odd and the number of b$$s is even and the number oStrings containing either the substring bcaa or cababf c$$s is even

$2)$ Strings containing either the substring bcaa or cabab