Question: Suppose numeric palindromes that consist only of digits, such as 34943 and 1001, but not 1121, 1A1, or "abba". Let p(n) be the number of palindromes of length n.
Part 1: Write a mathematical, recursive definition of p(n).
Part 2: Prove that your answer to Part a is correct by using mathematical induction.
Need a solution for both a and b , with good explanation
You have to implement a recursive definition of function.