Question #9 (5 points) Consider the bottom-up solution to the longest common subsequence problem presented in Section 15

[answerhappygod]

Question 9 5 Points Consider The Bottom Up Solution To The Longest Common Subsequence Problem Presented In Section 15 1 (96.99 KiB) Viewed 33 times

Question #9 (5 points) Consider the bottom-up solution to the longest common subsequence problem presented in Section 15.4 of your textbook. Provide clear, concise answers to each of the following related questions. • (5 points). Recall that the c[i, j] array records the number of characters in the longest common subsequence between a prefix of X of length i, and a prefix of Y of length j. Complete the following c array for inputs X =< w, a,b, x > and Y =< a, y, b, z >. Cij W a b х x a у b Z Question #10 (15 points) Recall the Optimal Activity Selection problem presented in class. Consider the following set of potential activities S, all requiring access to the same resource: i 1 2 4 5 6 Si fi 2 6 4 8 3 7 18 16 20 32 170 64 190 7 128 194 8 256 276 9 512 2000 10 1024 2048 11 2048 4000 • (5 points). In exploring the dynamic programming solution to this prob- lem, we defined the set Sij. Provide the value of S2,8.