Could you please give a clear dp pseudocode answer, and the running time of the method, and explian the pseudocode and idea.

Thank you very much.

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 palindromic 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 x[1 n] and returns the (length of the) longest palindromic subsequence. Its running time should be