(b) The sequence alignment problem may be solved by the following dynamic programming algorithm: 1 X Sequence Alignment(X, Y): Let BRCO) - i *y for each 1 sism Let BBCO.j) - i * for each 1 sismm For in For jj = 1 tot mm 3861- min [1m. 11+ BBC - 1,-1), 77 +386.j-1) 71 +386 - 1).] Where Tha (1.,11.) and I = (191.jpen) are two sequences to be aligned, w(1) is a penalty associated with matching symbol pto , and yy is a gap penalty, The sequence alignment algorithm is applied using the following data: = II = (a,b,) (a, b), 0, 0, 1) vy=4 The delta function is defined for symbols in the alphabet (aa, bb, LL} a B a 4 5 b 0 4 5 7 0 7 0 Generate the problem space matrix BB and thus determine the optimal alignment between XX and YY