3. Iteration and Recursion (20 points) a. (10 points) Complete method int getProductR(int low, int high)...

Transcribed Image Text:

3. Iteration and Recursion (20 points) a. (10 points) Complete method int getProductR(int low, int high) using a recursive process to re- turn the product of the integers from low to high (inclusive). Some examples follow: getProductR(1, 4) will return 24 which is the product 1*2*3*4. getProductR (-2, 5) will return 0 because 0 is included in the range making any product 0. getProductR(-3, -1) will return -6 because -6 is the product of -3 * -2 * -1. getProductR (7, 4) will return 1 because there are no integers in range 7... 4, so the identity value for multiplication (1) is returned public static int getProductR(int low, int high) { b. (10 Points) Using an iterative process, solve the same problem as in part (a) above for the method getProductI(int low, int high). public static int getProductI(int low, int high) { 3. Iteration and Recursion (20 points) a. (10 points) Complete method int getProductR(int low, int high) using a recursive process to re- turn the product of the integers from low to high (inclusive). Some examples follow: getProductR(1, 4) will return 24 which is the product 1*2*3*4. getProductR (-2, 5) will return 0 because 0 is included in the range making any product 0. getProductR(-3, -1) will return -6 because -6 is the product of -3 * -2 * -1. getProductR (7, 4) will return 1 because there are no integers in range 7... 4, so the identity value for multiplication (1) is returned public static int getProductR(int low, int high) { b. (10 Points) Using an iterative process, solve the same problem as in part (a) above for the method getProductI(int low, int high). public static int getProductI(int low, int high) {