Let S be the set of all strings from A* in which there is no b before an a. For example, the strings , aa, bbb, and aabbbb all belong to S, but aabab S. Give a recursive definition for the set S. (Hint: a recursive rule can concatenate characters at the beginning or the end of a string.)