4. The following equation describes the recurrence underlying our dynamic

programming algorithm for Edit Distance for the case of operations COPY

(cost 0), INSERT (cost 2), DELETE (cost 2) and REPLACE (cost 3). Here, as

in the course, c[i,j] describes entry (i.j) of the dynamic programming table, 7₂

is character number i of the input string and y; is character number j of the

output string, 1

ci-1.j-1]

c[i,j] = min 3+ci-1.j-1]

if i = 0 and j = 0

if i > 0, j>0 and z = 95

ifi>0 and j> 0

if i > 0

if j > 0

2+ci-1.j

(2+ci.j-1]

Describe a modification of the equation to incorporate the following operation: