$1$ Recursive Definitions

For each recursive definition of some set of binary strings $B$ below, describe set $B$ in a nonrecursive way. ${?}^1$

base case: $inB$

recursive rule: if xinB then $0$xinB and $x1$inB

base case: $inB$

recursive rule: if xinB then $0x1$inB

base case: $1$inB

recursive rule: if $x,$yinB then $x0$yinB

base case: $1$inB and $0$inB

recursive rule: if $x,$yinB then $x0$yinB

base case: $1$inB and $inB$

recursive rule: if $x,$yinB then $x0$yinB. Please write out on paper, thanks $!$