For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the alphabet Σ = {a,b} in all parts.

a. a^*b^*

b. a(ba) ^*b

c. a^* ∪ b^*

d. (aaa)^*

e. Σ^*aΣ^*bΣ^*aΣ^*

f. aba ∪ bab

g. (ε ∪ a)b

h. (a ∪ ba ∪ bb)Σ^*