Prove by math induction!

Consider a set of strings defined recursively as follows: Base case: a es Recursive rules: if x S then, o xD e S (Rule 1) obxe S (Rule 2) Prove that every string in S contains exactly one a