help within 1 hr pleaseeee!!

algorithms Design and Analysis sestion el mod Using the following uncompleted solution for LCS problem. Answer the following A) Compute the missing numbers: A(8,6). A[8.7) and A(8,8). Show how you get the numbers B) Where can you find the length of the longest common subsequence between "DCAD and "ACRADY? c) Write down the longest common subsequence between BCADDBA and ACBADCBA based on this taste out of question 0 1 2 3 4 5 6 7 8 A CB A D C B A 0 010 O100 0 0 0 0 1 1 1 1 11 2 CO 0 1 1 1 1 2 22 3 A011 1 2 2 2 23 4 DO 1 1 1 23 33 S D 01 1 1 23 33 6 B 01 1 2 23 3 414 7 A011 1 2 33 45 8 B 0111 23 3 3 EE $