Let #0(s) and #1(s) denote the number of 0s and 1s in a bitstring s, respectively. Using your recursive definition from the previous exercise, prove by structural induction that, for any palindromic...

Let #0(s) and #1(s) denote the number of 0s and 1s in a bitstring s, respectively. Using your recursive definition from the previous exercise, prove by structural induction that, for any palindromic bitstring s, the value of [#0(s)] [#1(s)] is an even number.