This problem involves matrices (dynamic programming). The solution is below. I was wondering if someone could walk me through the conclusion and how the red numbers were filled in (by what process). For a better understanding. Thanks!

ID: 11) We want to find the best alignment(s) between the protein sequences WWYCTY and WCYTY. The scoring scheme S is defined as follows: S(i,i)-10. S(?-5 if i andj are both aromatic amino acids, and SGJ)-0 otherwise. There is a constant gap penalty of 5 (gaps at the beginning are not considered, see below). The score Sbest and the number N of optimal alignments are (show your final dynamic programming matrix and optimal alignment (s) for full credit) A) Sbest-40, N 1 W105 0 C 5 10 5 15 55 C) Sbest 35, N-1 Y 0 1020 5 15 20D) Sbest -40, N-2 T-5510 20 2515 Y | 0 | 10 | 15 | 15 | 20 | 35 ptimal alignment (traceback shown in bold): WWYCTY WCY-TY ID: 11) We want to find the best alignment(s) between the protein sequences WWYCTY and WCYTY. The scoring scheme S is defined as follows: S(i,i)-10. S(?-5 if i andj are both aromatic amino acids, and SGJ)-0 otherwise. There is a constant gap penalty of 5 (gaps at the beginning are not considered, see below). The score Sbest and the number N of optimal alignments are (show your final dynamic programming matrix and optimal alignment (s) for full credit) A) Sbest-40, N 1 W105 0 C 5 10 5 15 55 C) Sbest 35, N-1 Y 0 1020 5 15 20D) Sbest -40, N-2 T-5510 20 2515 Y | 0 | 10 | 15 | 15 | 20 | 35 ptimal alignment (traceback shown in bold): WWYCTY WCY-TY