Answer Happy

Natural Language Processing
All the information has been given.
(20%) Computing minimum edit distances by hand with matrix, figure out whether drive is closer to brief or to divers and what the edit distance is. Suppose the operational costs for Insertion, Deletion and Substitution are 1, 1 and 2 respectively. (20%) Determine and draw the backpointers for the edit distance matrix of drive and divers in Question (3) with diagonal (_), left (+-) and down (!), and draw the alignment of the two strings.