In lecture we defined the recurrence of the longest-increasing-subsequence(LIS) problem as: 0 LISLEC(i 1, j) LISLEC(i, j) = (i 1, j) 1 LISLEC(i1,i) i = 0 A[i] A[j] A[i] n LISLAB(i, j) = LISLAB(i 1, j) if i n and A[j] A[i] (2) LIS (i 1, j) L AB otherwise max 1 LISLAB(i 1,i) Is one of them wrong? If not, what's the difference? Your solution should be a simple, short, english description of each recurrence. No long proofs for correctness are necessary. This is to make sure you understand how to describe a function (and no, saying "LIS returns the longest increasing subsequence length." is not a sufficient description)