CS 202, Fall 2007 Group Assignment #1: 10 Points. Due Date: Thursday, 11/29/07. Submit one set of solutions for each group on the Blackboard group pages bulletin board. Clearly identify the solutions to be graded in the subject line of the posting. Each member of the group must contribute to the solutions submitted by the group. (4) 1. Exercise 21.12. Show how to convert the following infix expression to postfix using the algorithm on page 1038: 4 + 3 * 2 ^ 2 % 8 Compile and test the code for function convertToPostfix() from the textbook folder ch21/p21_12. Modify the code to handle the modulus (%) operator with the same precedence as multiplication and division. Identify and document all changes to the original code. Test the program on the infix expression given above. Extra Credit: The exponentiation operator (^) is right associative with higher precedence than the multiplicative operators. Determine if the textbook code handles exponentiation correctly. If not, correct the code and document the change as a bug fix, as noted below.** (4) 2. Exercise 21.13. Evaluate the postfix expression resulting from Problem #1 by hand using the algorithm on page 1039. Compile and test the code for function evaluatePostfixExpression() from the textbook folder ch21/p21_13. Modify the original code to handle the modulus operator (%) and test the modified code on the postfix expression from Problem #1. Identify and document all changes to the original code.** (2) 3. Study the description of the Simple language in Exercise 21.26. Write a Simple program to read a positive integer, N, and calculate and print the factorials from 1! to N!. It is not required to run the Simple factorial program (yet). Include comments in the program. **For full credit, turn in fully commented program listings, including your name and the problem number, and the output from test runs exactly as produced by the program. Extra credit will be given for bugs found and fixed in the textbook code. Bug fixes must be fully tested and documented for maximum credit.