Solve the following excercises:
Section 5.1: 22, 60
Section 5.2: 12, 38
Section 5.3: 26
Bonus question for extra credit:
Given an arbitrary alphabet of symbols, a palindrome is a string which is the same when read backwards and forwards. Examples: "abccba", "abcba". Provide a recursive definition of the set of all palindromes over a fixed alphabet and use structural induction to show that your definition is correct.
All excercises are worth 20 points.