$($b$)$ Consider a set of strings defined recursively as follows:

Base case: ainS

Recursive rules: if xinS then,

xbinS $($Rule $1)$

bxinS $($Rule $2)$

Prove that every string in $S$ contains exactly one $a.$