Problem $1.(20$ pts$)$ Use the dynamic programming method to compute the edit distance between ALVAD and AVAND. To get full credit here, and in other tests, you need to compute the edit distances for all prefixes $($as I did in the Word le for CARTON and ARBOR$).$ As a result of the computation, you are expected to get an optimal alignment and its cost, which is the edit distance.

$\backslash$table$[[,-,$C$,A,\backslash$table$[[R$