public class StringUtility {

public static String reverse(String sentence) { // Delete the content in here and write your code in here. return ""; }

public static char maxOccuringCharacter(String sentence) throws IllegalArgumentException { // Delete this and write your code in here return 'a'; }

public static boolean isPalindrome(String input) { // Delete this and write your code in here

return result;

} }

Problem 1: Reverse (10 points) This method takes in a sentence as a parameter and returns the reverse of the sentence by word. For this particular problem, we will convert all our sentences to lowercase. The result should only return the strings separated by a single space, although the input may contain multiple spaces in between them. Example: reverse("This is a SENTENCE") will return "sentence is a this". reverse("This SENTENCE") will return "sentence this". Problem 2: maxOccuring Character (20 points) This method takes a sentence and counts the max occurring character. It ignores all the spaces, punctuations, digits and converts all the uppercase to lowercase letters. Example: maxOccuring Character("i") = "' maxOccuring Character("lij") = '1' Problem 3: isPalindrome (10 points) This method checks whether the given string is a palindrome or not. A palindrome is a word, number, phrase, or other sequences of characters that read the same backward as forward, such as madam or racecar. An empty string is considered to be a palindrome