For the sequence alignment problem, modify the code on page 282 to also produce (output) the actual alignment that gives the optimal value of the alignment. The language in the picture is C pseudocode

D sp18401 Ngor h Yo LetG- VG chegg s @fo The ? 7 c D www.icsd.degean.gr kaporisa index files/Algorithm Lesign.pdf ?eThis ISA Ya The Ger .Ve Recall T xVe Problem GProbler ? asuppose.x The Gen 154 432 Alignment (X,Y) Array A[0... m, 0...n] Initialize A[i,0] ?? for each i Initialize A(0,j] =ja for each j For j-1, .. . , n For i- 1, .. . , m Use the recurrence (6.16) to compute Ali,j] Endfon Endfor Return A[m, n] As in previous dynamic programming algorithms, we can trace back D sp18401 Ngor h Yo LetG- VG chegg s @fo The ? 7 c D www.icsd.degean.gr kaporisa index files/Algorithm Lesign.pdf ?eThis ISA Ya The Ger .Ve Recall T xVe Problem GProbler ? asuppose.x The Gen 154 432 Alignment (X,Y) Array A[0... m, 0...n] Initialize A[i,0] ?? for each i Initialize A(0,j] =ja for each j For j-1, .. . , n For i- 1, .. . , m Use the recurrence (6.16) to compute Ali,j] Endfon Endfor Return A[m, n] As in previous dynamic programming algorithms, we can trace back