Write the function longestsubpalindrome(s), that takes a string s and returns the longest palindrome that occurs as consecutive characters (not just letters, but any characters) in s.
so longestsubpalindrome("ab-4-! ") returns "b-4-b".if there is a tie, return the lexicographically larger value -- in python, a string s1 is lexicographically greater than a string s2 if (s1 > s2).
so: longestsubpalindrome("abcbce") returns "cbc", since ("cbc" > "bcb"). note that unlike the previous functions, this function is case-sensitive (so "a" is not treated the same as "a" here).

8. create an abstract student class for parker university. the class contains fields for student id number, last name, and annual tuition. include a constructor that requires parameters for the id number and name. include get and set methods for each field; the settuition() method is abstract. create three student subclasses named undergraduatestudent, graduatestudent, and studentatlarge, each with a unique settuition() method. tuition for an undergraduatestudent is $4,000 per semester, tuition for a graduatestudent is $6,000 per semester, and tuition for a studentatlarge is $2,000 per semester. write an application that creates an array of at least six objects to demonstrate how the methods work for objects for each student type. save the files as student.java, undergraduatestudent.java, graduatestudent.java, studentatlarge.java, and studentdemo.java.