Delete 1. (5 points) Edit Distance denoted as EditD. (X, Xi) between two strings Source string: X = X1, X2, X3, X and Target string: Y = V, V2, V3, Is the minimum cost to transform the Source string X; (of length i) to the Target string X (of length j), with minimum number of cycles, using edit operations insert, delete, or replace. Consider the cost of insert operation is 1 cycle; cost of delete operation is 2 cycle; and cost of replace operation is 3 cycles. Construct solution to transform the source string: MUSIC to DYNAMIC with fewest number of cycles. The recursive equation is reproduced below to help you. If (x==) then EditD (X, Xi) = EditD. (X-1, Yj-1) If (x; != y) then EditD (X, X) = minimum Your answer must include the following Dynamic Programming table (3 points) and the sequence of transformations (2 points). M U S I Insert 0 D NO EDIT OPERATION IS NEEDED EditD (X,Y-1) + cost of insert c (1) EditD (X-1,Y) + cost of delete Cd (2) EditD (X-1Y-1+ cost of replace Cr (3) Y N A M