Let S be the set of bit strings defined recursively by

$\backslash$lambda in S and

$0$x in S$,$ x$1$ in S if x in S$,$

where $\backslash$lambda is the empty string.

Find all bit strings of length three in S$.$