# Question: suppose that a language l a b is...

###### Question details

Suppose that a language L ⊆ {a, b} ∗ is defined as follows: (1)
**ε** ∈ L, (2) If x, y ∈ L, then so are xayb and xbya,
(3) Nothing else is in L. Prove by induction that strings in L have
the same number of a’s and b’s.