Let $=\{0,1\}.$ For each language $L$ described below, write down a regular expression $r$ such that

$L(r)=L.$ That is$,$ the strings of ${}^{**}$ that match $r$ are exactly the strings of $L.$ Be careful to make sure

that nothing else matches the regular expression you write down! Justification is not required.

$($a$)|)$:$\}$ starts with a $1$