Exercise 8.9.2: Proving facts about recursively defined sets of strings. (a) Consider a set of strings defined recursively as follows: Base case: a eS Recursive rule: if x e S then, o xb e S (Rule 1) o xa e S (Rule 2) Prove that every string in S begins with the character a