In C++

10. (5 points) Box trace.

Show the box trace of madam for the recursive version of the palindrome as defined below. Clearly identify the order boxes are created and any return values. An example call to this function is

isPalindrome(MADAM,0 , 4) returning true

bool isPalindrome(char str[],int s, int e)

{

// If there is only one character

if (s == e)

return true;

// If first and last

// characters do not match

if (str[s] != str[e])

return false;

// If there are more than

// two characters, check if

// middle substring is also

// palindrome or not.

if (s < e + 1)

return isPalindrome (str, s + 1, e - 1);

return true;

}

10.1 (5 points) Show the STACK for converting the following infix expression to postfix. a+ (b*c) % d.

Clearly show your stack clearly and write the final postfix expression at the end.