Answer needs to SHOW: -Proof of correctness -Proof/analysis of running time 2. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence A, C,G,T, G,T C, A, A, A, A, T, C, G has many paindromic subsequences, including A, C, G,C, A and A, A, A, A (on the other hand, the subsequence A, C, T is not palindromic) Devise an algorithm that takes a sequence r[1,..., n] and returns the (length of the) longest palindromic subsequence. Its running time should be O(n2