C++

//*******TO DO********* #include #include using namespace std; // Suppose you have a n ounce pitcher and a 1 ounce glass. // The goal is to fill the pitcher using a glass // compute recursively how many times you should fill the glass and pour it in the pitcher // the pitcher does not need to be full. For example, if you have a 11 ounce pitcher and a 2 ounce glass, the answer is 5 int Fillpitcher(int n, int 1) { //*******TO DO********* } // ##### CHECKING WHETHER A STRING IS A PALINDROME (the string and its reverse are similar) ## // Hint 1: you can call s.front) to get the first character of string and s.back) to get the last one 1/ Hint 2: S.substr(i,j) gives you the substring of s from i to j. 1/ For example if s = Hello, s.substr(1,s.length()-1) gives you ello. and s.substr(0,3) gives you Hell :D bool is_palindrome (string s) { //*******TO DO********* } 7/ ##### REVERSING A STRING #### // string reverse(string s) { //*******TO DO********* } int main() { cout