Create a recursive Java method getProduct to compute the product of two positive integers, m and...

 

Transcribed Image Text:

Create a recursive Java method getProduct to compute the product of two positive integers, m and n, using only addition and subtraction. Implement the Java code. Test the method by calling it in the main method of the relevant class. Hint: You need subtraction to count down from m or n and addition to do the arithmetic needed to get the right answer. The linearSum method from Lesson5Examples posted in the eCentennial module "Lesson Examples (from textbook)" may be helpful. Exercise 2 (5 marks) Write a recursive Java method isPalindrome that determines if a string s is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and 'aaabbaaa'. Test the method by asking the user to provide string entries to be checked. Hint: Check the equality of the first and last characters and recur (but be careful to return the correct value for both odd and even-length strings). (5 marks) Create a recursive Java method getProduct to compute the product of two positive integers, m and n, using only addition and subtraction. Implement the Java code. Test the method by calling it in the main method of the relevant class. Hint: You need subtraction to count down from m or n and addition to do the arithmetic needed to get the right answer. The linearSum method from Lesson5Examples posted in the eCentennial module "Lesson Examples (from textbook)" may be helpful. Exercise 2 (5 marks) Write a recursive Java method isPalindrome that determines if a string s is a palindrome, that is, it is equal to its reverse. Examples of palindromes include 'racecar' and 'aaabbaaa'. Test the method by asking the user to provide string entries to be checked. Hint: Check the equality of the first and last characters and recur (but be careful to return the correct value for both odd and even-length strings). (5 marks)