Writing a recurisve function for palidromes that will return true if an input string S of length n >= 0 is a palidrome and false otherwise.an empty string will also be a palidrome and a string only with a single character is also a palidrome. Also to note cannot use any libraries for this.

The language is also c++

bool is_pal(const char *S, unsigned int n);