$3.$ Show that the following languages $(\backslash$Sigma $=\{0,1\})$ are regular $($or not$)$:

$($a$)$ L$3$a $=$

$1$

k

y$|$ y in $\{0,1\}$

$$

and y contains at least k $1$s$,$ for k $>=1$

$($b$)$ L$3$b $=$

$1$

k

y$|$ y in $\{0,1\}$

$$

and y contains at most k $1$s$,$ for k $>=1$