lider the basic dynamic programming algorithm used to solve the problem of global sequence alignment with a linear gap model. Match each of the nts of the problem with the modifications required in the algorithm to solve it Semi- A. First row and first column of the dynamic programming score table is set to zero. global akigment 'After the dynamic programming table is completed, the maximum score in the last row or last column is used as the alignment score. Local B. * The score calculation rule (which contains the maximum of three options) is extended with zefo as the fourth option abgnment 'After the dynamic programming table is completed, the maximum score in the entre table is used as the alignment score. Multiple C. "The score calculation rule (which contains the maximum of three options) is extended with zero as the fourth option. local alignments "After the dynamic programming table is completed, the maximum score in the entire table is used as the alignment score. The alignment path for this is also identified. "The alignment path for the above alignment is "frozen" to zero in the dynamic programming table. 'A new alignment is calculated, but in the dynamic programming table, the cells that are frozen to zero are not modifed. The resulting alignment is again used to freeze additional cells in the table. This process is repeated until an alignment with a high score (above a predetermined threshold) cannot be found. Wuns ch Smith B. In a global alignment algorithm, the a dynamic programming scoring table is calculated by recording for each ceil, the best posible score for that cell, out of the three possible ways of moving into that cell Along with this scoring table, we can also keep a "path table" that records which of the three moves had the highest score. After the alignment scoring table has been calculated, we can mat start from the last cell and look at the path table to identify all the moves that had to be laken. Whereas the scoring lable would only have given us the optimai alignment score, visiting the path table gives us the alignment itseif. What is the process of using the path table to recover the alignment called? Trace: C. Tolal Gap Penalty = (number of gap openings) * (Gap Open Penalty) * (number of gap extensions) * (Gap Extension Penalty) back Semi D. Local alignment algorithm globa I alig nmen t Linea E. Total Gap Penally = (number of gaps) * (Gap Penalty) I Gap Penal ty Affine. F. Allowing the sequences to have flanking ends without incurting any gap penaltes. (aka "free end gaps") Gap Penal ty