5. The following is a slightly modified version of the longest increasing subsequence algorithm. LONGEST-SUBSEQUENCE (A) n = A.length Let D[1..n) and P[1 ..n] be new arrays D[1] = 1 P[1] = 0 for i = 2 ton D[i] = 1 P[i] = 0 for j = 1 to i - 1 if A[j] D[i] D[i] = D[j] + 1 P[i] =j L = 0 for i = 1 ton if D[i] >L L = D[i] Kri return L,P,K For the following array: A[1] = 12, A[2] = 27, A[3] = 11, A[4] = 18, A[5] = 24, determine the values of D[1], D[2], D[3], D[4], D[5], P[1], P[2], P[3], P[4], P[5], L, and K