Construct a DFA for each of the following languages

$($a$)\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{**}\text{:}bb\end{array}$ appears at most once as a substring of $\{$:$w\}$

$($b$)\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{**}\text{:}\text{b}\text{a}\text{b}\end{array}$ is not a substring of $\{$:$w\}$

$($c$)$ The set of strings over $\{a,b{\}}^{**}$ that either begin or end $($or both$)$ with $ab.$

$($d$)$ The set of strings over $\{a,b{\}}^{**}$ that contain an odd number of $a\text{'}$s and end in at least two $b\text{'}$s$.$