Consider the Edit Distance problem where edit operations

have a cost and the goal is to maximize editing score in which matches

are awarded positive scores. Consider editing between the two strings

$$Distance$$ and $$Destiny$.$ Assume a match is awarded score $+4,$ an

insertion or deletion is penalized with $-2,$ and a mismatch with $-4.$

$($a$)$ Write the DP recursive solution $($or equation$)$ for the above prob$-$

lem.

$($b$)$ Using the recursive solution in part a create a dynamic program$-$

ming table for the problem above using the two given strings.

$($c$)$ Looking at the table give the total cost of editing and sequence

of operations performed to achieve that editing.