Problem $2.$ Find regular expressions on $\backslash (\backslash$Sigma$=\backslash \{0,1\backslash \}\backslash )$ which define the following languages:

$($a$)$ The language consisting of strings which alternate characters.

$($b$)$ The language consisting of strings where $1$ is never repeated more than twice in a row.