Write a recursive function bool isPalindrome(string s) that returns true if s is a palindrome and false otherwise. Recall that a palindrome is a string that is the same forwards and backwards. For instance, racecar is a palindrome. Once again, a helper function might make things easier.

bool isPalindromeHelper(string s, int start, int end){

return false;

}

bool isPalindrome(string s){

return false;

}

----------------------------------------------------------------------------------------------------------------------------------------

Write a recursive functionbool isSorted(const vector &v, int start, int end) that determines whether or not the the elements of v from index start through index end (in- clusive) are sorted in ascending order.

bool isSorted(const vector &v, int start, int end){

return false;

}

----------------------------------------------------------------------------------------------------------------------------------------

Write a recursive function int rBinarySearch(const vector &v, int low, int high, int target) that uses a binary search to find the index of target in the sorted vector v. If target is not in the vector, the function should return 1. You can assume that v will not contain duplicate values.

int rBinarySearch(const vector &v, int low, int high, int target){

return 0;

}

In C++ please