In the LCS problem, we are given as input two sequences, X = (x1, x2, ..., Im) and Y = (y1, y2, ..., Yn) and would like to find a longest subsequence common to both. Towards this end, we define c[i,...

Extracted text: In the LCS problem, we are given as input two sequences, X = (x1, x2, ..., Im) and Y = (y1, y2, ..., Yn) and would like to find a longest subsequence common to both. Towards this end, we define c[i, j] := length of LCS of X; and Y;, where X; := (x1, 2, ...;) and Y; := (y1, y2, -.y;) and obtain the following recurrence. if i = 0 or j = 0 if i, j>0 and ri = Yj c[i, j] = { c[i – 1, j – 1] +1 max(c[i, j – 1], cļi – 1, j]) if i, j > 0 and r; + yj Analyze the (asymptotic) running time: What is the running time for computing each entry?