Consider the two strings co and ACD. Based on the alignment algorithm covered in the lecture (Dynamic Programming, Needleman- Wunsch), consider the following alignment matrix for the two strings. E A CD E D Using the penalty of -1 for both leaving a single gap and a substitution of a letter, write the resulting alignment matrix as blank- separated text matrix, followed by the alignment, in the format indicated by the example below. Example: the format of a submission would look like this one below has completely fictional entries and only serves as example): 0 -4 -5 -8 -3 -3 - 7 -10 | -4 -5 -6-9 with the alignment (this is again purely fictional and in no way correct and only to illustrate the submission format) C---D -ACD- The dashes denote a gap