If a is a symbol and s is a string, define #a(s) to be the number of occurrences of a in s. For example, #1(101100101) = 5. Define #a(s) inductively, and then prove by structural induction that for any strings s and t, #a(s· t) = #a(s) + #a(t).