Define any subproblems, give the Recurrence Relation, Pseudocode and Asymptotic Runtime please

(a) For the Longest Increasing Subsequences problem, show how to modify the following dynamic programming algorithm we saw in class to also return what the longest increasing subsequence is, not just how long it is. LIS(Array A of length n) { Create Array L or length n initially all ones For j = 2, .., n: For i = 1, .., j - 1: If A[i] L[j]: L[j] = L[i] + 1 Return L(n) }