![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](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fa7e%2Fa7e41f72-2c20-47d9-855e-f72b2c3484ff%2Fphp1a0Oxb.png)
Could you please give a clear dp pseudocode answer, and therunning time of the method,
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured
![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](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fa7e%2Fa7e41f72-2c20-47d9-855e-f72b2c3484ff%2Fphp1a0Oxb.png)
Could you please give a clear dp pseudocode answer, and therunning time of the method,
PayPal Gateway not configured
PayPal Gateway not configured