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, ulv S, and luv S. Use structural induction to prove that each element in S is a bit string that contains more zeros than ones