This is for an Introduction to Algorithms course, so no specific programming language should be used.

Please write the algorithm in general pseudocode and provide Proof of Correctness and Runtime Analysis.

Please show your work, and DO NOT use any pre-existing solutions to this question on Chegg Study.

Given a sequence of characters C1, ..., Cn, we say that a subsequence is a palindrome if it reads the same forwards and backwards. For example, "a,b,a,c,a,b,a" is a palindrome. Give an O(n2) time algorithm to find the longest palindrome subsequence in the input sequence C1,..., Cn. For example, in the sequence c,l, m, a,l, f,d,c, a, f, m, the longest palindrome subsequence is m, a, d,a,m. HINT: For i