Question $15$

$S$ is a set of strings over the alphabet $\{a,b{\}}^{**}$ recursively defined as:

ainS

Rule $1$: axinS

Rule $2$: bx inS

List all the strings in $S$ of length $3.$