(2 points) Consider the following recursively defined set S of bit strings. basis step: 1ES recursive step: If u E S and v E S, then uv E S, uv0 E S, uOv E S, and OuvES Use structural induction to prove that each element in S is a bit string that contains more ones than zeros