Problem: Give recursive definitions for the following sets. Demonstrate a derivation of at least one string in each language using your recursive definition. (For example, abab for set (a), 10100 for set (b).)

a) The set of all strings over {a,b}* containing at least one "a".

b) The set of odd-length binary strings that end with 00.