Develop (Step-wise) and implement an algorithm in java that aids in the creation of non-empty palindromes i.e. an algorithm that takes a user input string and produces a pre-set number of palindromes e.g. Given a string "annabelle" your algorithm should form 3 (or more)  palindromes such as ‘anna’, ‘elle’ & ‘b’.

Write a Program in Java Programing Language to find length of the longest palindromic subsequence from an user entered String. Your Code must be Highly Optimized.

Question

Recognizing strings based on a set of restrictions is a common computational problem. A Slop is a string of characters that has certain properties. Your program will read in strings of characters and output whether or not they are Slops. A Slip is a character string that has the following properties: Its first character is either a 'D' or an 'E' The first character is followed by a string of one or more 'F's The string of one or more 'F's is followed by either a Slip or a 'G' The Slip or 'G' that follows the F's ends the Slip. For example, DFFEFFFG is a Slip since it has a 'D' for its first character, followed by a string of two F's, and ended by the Slip 'EFFFG' Nothing else is a Slip A Slap is a character string that has the following properties: Its first character is an 'A' If it is a two-character Slap then its second and last character is an 'H' If it is not a two-character Slap, then it is in one of these two forms: 'A' followed by 'B' followed by a Slap, followed by a 'C'…