Problem 4. Sequence alignment. Consider the affine gap penalty: gap_start = the cost of starting a gap gap_extend = the cost of extending a gap by one more space 1. Write down a dynamic programming algorithm for global pairwise alignment with the affine gap penalty. You can assume that the match score and mismatch score are also given. 2. Provide the complexity of your algorithm. Is it optimal? Problem 4. Sequence alignment. Consider the affine gap penalty: gap_start = the cost of starting a gap gap_extend = the cost of extending a gap by one more space 1. Write down a dynamic programming algorithm for global pairwise alignment with the affine gap penalty. You can assume that the match score and mismatch score are also given. 2. Provide the complexity of your algorithm. Is it optimal