$($a$)$

Execute the "Hirschberg's algorithm" to find the edit distance and an optimal alignment, between the words "Plain" and "Plan", assuming the cost of gap is $\backslash (\backslash$delta$=2\backslash )$ and the cost of misalignment is $\backslash (\backslash$alpha$=1\backslash ).($The order of calls matter!$)$

$($b$)$

Execute the "Bellman$-$Ford$-$Moore algorithm" on the following graph, showing the vectors $\backslash ($ d$[$v$]\backslash )$ and successor $\backslash ([$v$]\backslash )$ at the beginning of each iteration. The destination node is $\backslash ($ t$=$F $\backslash ).$