4. (10 points) Consider the following recursively defined set S of bit strings basis step: 0 E S recursive step: Ifu eSandv e S, then uv e S, uvl e S,ulve S, and luveS Use structural induction to prove that each element in S is a bit string that contains more zeros than ones