Let a and b be two characters. define, recursively, a set s of strings by: e s (where e is the empty string) if x e s, then bbx e s, where xa and bbx represents concatenation of strings/characters prove, using structural induction, that vr e s, 3m, n integers, m, n z 0, so that-bb b 2m times n times