Q$2[10$ pts$]$ Give DFA's accepting the following languages over the alphabet $\backslash (\backslash \{0,1\backslash \}\backslash )$ :

a$)$ The set of all strings whose $3$ rd symbol from the right end is a $0.$

b$)$ The set of strings such that the number of $0\text{'}$s is divisible by $3$ and the number of $1\text{'}$s divisible by $2.$

Please do part B and draw out the dfa as a diagram