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 retum the strings separated by a single specs, although the input may contain multiple spaces in between them Example reverser"This is a SENTENCE") will return "Sentence is a this". reversal "This SENTENCE") wil relum 'sentaron this" Problem 2: maxOccuring Character (20 points) This method lakes 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"") = 1 maxOccuring Character = '1' Problem 3:isPalindrome (10 points) This method checks whether the given string isa palindrome or not. A palindrome is a word, namber, phrase, or other cuences of characters that read the same hackward as forward, such as malam ur racecar. An empty string is exonsidered to be a palindrome