e$.$ Consider $$ to be the Latin alphabet, comprising all $26$ capital letters. $v=$ BIOLGIA and $w=$ AOILGAI, utilizing local sequence alignment consider

the below proposed alignment $($with matches scored by $+1$ and everything else

$-1).$ In addition, consider the below table obtained using the Smith$-$Waterman

algorithm discussed in class.$($ii$)$ enumerate$/$list all optimal local

alignments. $[4$ points$]$Let $\backslash$table$[[$w$,0,$A$,$O$,$I,L$,$G$,$A$,$I$],[-,-,0,0,0,0,0,0,0],[$B$,0,0,0,0,0,0,0,0],[$I$,0,0,0,1,0,0,0,1],[$O$,0,0,1,0,0,0,0,0],[$L$,0,0,0,0,1,0,0,0],[$G$,0,0,0,0,0,2,1,0],[$I$,0,0,0,1,0,1,1,2],[$A$,0,0,0,0,0,0,2,1]$ Is A optimal?

Number of optimal alignments:

Optimal alignments $($you may or may not need all boxes$)$:

$V^{\text{'}},$

$W$ e$.$ Consider $$ to be the Latin alphabet, comprising all $26$ capital letters. Let

$v=$ BIOLGIA and $w=$ AOILGAI, utilizing local sequence alignment consider

the below proposed alignment $($with matches scored by $+1$ and everything else

$-1).$ In addition, consider the below table obtained using the Smith$-$Waterman

algorithm discussed in class. $($i$)$ Discuss whether the proposed alignment

is an optimal local alignment, and $($ii$)$ enumerate$/$list all optimal local

alignments. $[4$ points$]$