S is a set of strings over the alphabet {a, b} and is defined recursively as follows: Basis: λ ∈ S and b ∈ S Recursive rules: If x is in S, then bsa ∈ S and axb ∈ S Select the set that corresponds to all the strings in S of length 4.