describe an efficient algorithm to find the longest palindrome that is suffix of string of length recall that apalindrome is string that is equal to its reversal what is the running time of your methodc- given sequence ( - of numbersdescribe an ( )-time algorithm for finding longest subsequence (xi ,xi xi xi - of numberssuch that ij+ that ist is longest decreasing subsequence of - define the edit distance between two strings and of length and mrespectivelyto be the number of edits that it takes to change into an edit consists of character insertiona character deletionor character replacement for examplethe strings "algorithmand "rhythmhave edit distance design an (nm)-time algorithm for computing the edit distance between and - design greedy algorithm for making change after someone buys some candy costing cents and the customer gives the clerk $ your algorithm should try to minimize the number of coins returned show that your greedy algorithm returns the minimum number of coins if the coins have denominations $ $ $ and $ give set of denominations for which your algorithm may not return the minimum number of coins include an example where your algorithm fails - give an efficient algorithm for determining if pattern is subsequence (not substringof text what is the running time of your algorithmc- let and be strings of length and respectively define ( ,jto be the length of the longest common substring of the suffix of length in and the