Fill Recursive functions, must be done recursively!!!!!!!!!

#include #include #include using namespace std;

string removeFirst(string s) { //removes the first character of a string //e.g. f(abcde) = bcde }

string reduceFirst(string s) { //reduce the value of first letter by 1 //e.g. f(bob) = aob, f(C) = B }

string removeLower(string s) { //remove all lower case letters from a string //e.g. f(HelloWorld) = HW //hint: you don't need the ASCII values. }

bool palindromeTest(string s) { //test if a string is a palindrome (same going forward and backward, e.g. abcba) //assume s contains letters only //recall you can get the length of a string by calling string.length() }