We wish to find the longest common palindromic subsequence in a string. Read the above code snippet and choose the missing statements.
a)S1: DP[i][j]=0;
S2: DP[i][j] =1+DP[i+1][j-1]
S3: DP[i+1][j] ,DP[i][j-1]
b) DP[i][j]=0;
S2: DP[i][j] =2+DP[i+1][j-1]
S3: DP[i][j] ,DP[i+1][j-1]
c)S1: DP[i][j]=1;
S2: DP[i][j] =2+DP[i+1][j-1]
S3: DP[i+1][j] ,DP[i][j-1]
d) S1: DP[i][j]=1;
S2: DP[i][j] =2+DP[i+1][j-1]
S3: DP[i+1][j] ,DP[i+1][j-1]