Consider the following recursively defined set S of bit strings.

basis step: 0 S

recursive step: If u S and v S, then uv S, uv1 S, u1v S, and 1uv S.

Use structural induction to prove that each element in S is a bit string that contains more zeros than ones.

Transcribed image text