Linear Space Alignment $[10$ points$]$

Consider two sequences $v=$ TG and $w=$ ATCG of length $m=|v|=2$ and $n=|w|=$

$4,$ respectively. In this exercise, we will compute an optimal global alignment of the

two sequences using the Hirschberg algorithm. We will use a score of $+1$ for a match,

$-1$ for a mismatch, and $-1$ for a insertion$/$deletion $($i$.$e$.$ a gap penalty of $1).$

a$.$ The initial call is Hirschberg$(0,0,m=2,n=4).$ We need to identify the

middle vertex $(i^{*},\frac{n}{2}=2).($i$)$ Fill out the following table for this initial call

and $($ii$)$ indicate $i^{*}.[2$ points$]$

b$.$ What are the two recursive calls that are made in this initial invocation

point