Design and test a recursive function palindrome

Design and test a recursive function palindrome() which returns true if the entered string is palindrome, and false otherwise #include <iostream> #include<iomanip> using namespace std; cons tint LINE=80; void input_string( char a[], int &length ); void print_string( const char a[], int length ); void output( const char a[], int length ); bool palindrome( const char a[], int I, int j ); int main() { char a[LINE]; int length; input_string( a, length ); print_string( a, length ); cout << “Enter string length= “ << length << endl; output ( a, length ); } void input_string( char a[], int &length ) { cout << endl; cout << “Enter a string: “; cin >> a; length = 0; while ( a[length] != ‘\0’ ) ++length; } void print_string( const char a[], int length ) { cout << “Entered string: “; length = 0; while ( a[length] != ‘\0’ ) cout << stew(2) << a[length++]; cout << endl; } bool palindrome( const char a[], int I, int j ) { PLEASE DESIGN } void output( const char a[], int length ) { if( palindrome(a, 0, length-1 ) ) cout << “The string is a palindrome” << endl; else cout << “The string is not a palindrome” << endl; cout << endl; }