We wish to find the length of the longest common sub-sequence (LCS) of X[m] and
Y[n] as c(m,n), where an incomplete recursive definition for the function c(i,j) to
compute the length of the LCS of X[m] and Y[n] is given below :
cli,jJ=0, if either i=0 or j=0
=exprl1, if i,j > O and X[i-1]=Y[jā1]
=expr2, if i,j > O and X[i-1]#Y[jā-1]
Which one of the following options is correct ?
A:-expr1=0
B:-expr1=1+c[i-1,j]
C:-expr2=max{cli-1, jā1]....
See more