Construct the DFAs for the following languages. $\backslash$Sigma $=\{$a$,$ b$\}$

$($a$)\{$w$|$w has exactly two a$$s and at least two b$$s$\}$

$($b$)\{$w$|$w has an even number of a$$s and each a is followed by at least one b$\}$

$($c$)\{$w$|$w starts with an a and has at most one b$\}$

$($d$)\{$w$|$w does not contain the substring ab$\}$

$($e$)\{$w$|$w is any string not in a

$$

b

$\}$

$($f$)\{$w$|$w is any string not in $($ab$+)\}$

$($g$)\{$w$|$w is any string not in a

$\backslash$cup b

$\}$

$($h$)\{$w$|$w is any string that doesn$$t contain exactly two a$$s$\}$

$($i$)\{$w$|$w is any string except a and b$\}$