Apalindrome is a nonempty string over some alphabet that reads the same forward and backward. examples of palindromes are all strings of length 1, civic, racecar, and aibohphobia (fear of palindromes). give an efficient algorithm to find the longest palindrome that is a subsequence of a given input string. for example, given the input character, your algorithm should return carac. what is the running time of your algorithm?

How do i get the most points, without any effort?

2pointswho was mikhail gorbachev? oa. a russian leader who opposed a coupob. a polish leader who founded the labor union "solidarityoc. a soviet leader who called for a closer relationship with the unitedstates, economic reform, and a more open societyd. a soviet leader who called for more oppression in the soviet union

Freya realizes she does not have enough in her bank account to use the debit card. she decides to use a credit card instead. which questions should freya answer before using a credit card? check all that apply. can i pay at least the minimum payment each month? can i make payments on time and avoid late fees? will i have to take out a loan? how much in finance charges can i afford to pay? should i talk to a consumer credit counseling service?