Suppose $\backslash$Sigma $=\{0,1\}.$ Show how to define the following languages over $\backslash$Sigma using only $,$

tokens $0$ and $1,$ and the operations of union, concatenation, and closure.

$($a$)$ All strings that begin with $0$ and end with $1$