Tree and Center Star Alignment $[25$ points$]$

Consider the following four strings $v_1,v_2,v_3,v_4$ :

$v_1$: CGGGAGTGA

$v_2$: CGTTAGGGA

$v_3$: CGTTGGA

$v_4$: AGTTGGGAA

Here are their pre$-$computed optimal pairwise alignments with a cost of $0$ for matches and $1$ otherwise:

a$.$ Give $($i$)$ all induced pairwise alignments and $($ii$)$ their scores of the following multiple sequence alignment of $v_1,v_2,v_3,v_4.$

$v_1$: CGGGAGTGA$-$

$v_2$: CGTTAGGGA$-$

$v_3$: $CGTT-GG-A-$

$v_4$: AGTT$-$GGGAA

Use the same cost$/$scoring function as Edit Distance. So a cost of $0$ for matches and $1$ for mismatches$/$gaps$.[5$ points$]$