20 Question 37 (15 points) Construct the Huffman code tree for the following characters. A: 24 B: 12 C: 10 D: 8 E: 8 0 Answer this question on a sheet of paper and turn it in to your instructor. Save Question 38 (10 points) Given the following algorithm to solve the problem of LCS. LCS (A, B, n, m) I is the length of String A and m is the length of string B 1, if n-0 or m=0 return 0 2. if A[n] B[m] return 1 + LCS(A, B, n-1, m-1) 3. else return max( LCS(A, B, n-1, m) LCS(A, B, n, m-1)) a. (10 points) What is the asymptotic running time of the algorithm? Answer the question right here... Save Previous Page Next Page Save All Resnonses