Give short answers to each of the following parts $($alphabet consists of a$,$ b$)$:

$($a$)$ Give a DFA for the language having regular expression

a

$$

b

$$

a

$$

b

$$

a

$$

b

$$

a

$$

b

$$

$($

$\backslash$Sigma

$=$

$\{$

a

$,$

b

$\}$

$\backslash$Sigma $=\{$a$,$b$\}).$ You only need to draw the picture.