(b) The sequence alignment problem may be solved by the following dynamic programming algorithm: SequenceAlignment(X, Y): { Let B(i, 0) + i x y for each 1 sisn Let B(0,j) - jxy for each 15 jsm For it 1 ton For j = 1 to m B[i,j) min [8(xi, yj) + B(i 1,j 1), y + B(i,j 1), y + B(i 1),j] = Where X = (X1, ..., xn) and Y = (v1, ..., Ym) are two sequences to be aligned, 8(p, q) is a penalty associated with matching symbol p to q, and y is a gap penalty. The sequence alignment algorithm is applied using the following data: X = (a, b,c) = Y = (a, b, a, b,b) = V = 4 The delta function is defined for symbols in the alphabet {a,b,c} : a B a 0 4 5 b 4 0 7 5 7 0 Generate the problem space matrix B and thus determine the optimal alignment between X and Y