Draw DFAs for the following language specifications.

All strings on $\backslash$Sigma $=\{$A$,$ B$,$ C$\}$ that contain each letter $($A$,$ B$,$ and C$)$ at least once.

All strings on $\backslash$Sigma $=\{$X$,$Y$,$ Z$\}$ that contains two consecutive Xs or three consecutive Zs $($or both$).$

All strings on $\backslash$Sigma $=\{$A$,$B$,$C$,$D that match the Python regular expression $^($A$?($B$|$CD$)*$A$+$D$)$$