Give a recursive definition of C(n)

Consider palindromes that consist of only lowercase letters, such as "level" and "deed," but not "RadaR," "ADA" or "101." Let C(n) be the number of palindromes of length n. Give a recursive definition of C(n). I would like to have the solution to this problem. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform BORLAND C++ VERSION 5.02