Please explain in much details as possible.

Extra Credit 5. The Damerau-Levenshtein distance https: //en.wikipedia.org/wiki/Damerau%E2%80% 93Levenshtein distance allows the transposition of adjacent characters in addition to the insertion, dele- tion, and substitution allowed by the Levenshtein distance. The distance function can be recursively defined as follows max(i,j) if min(i, j) 0 DL(P, Q,i-1,j) +1 DL(P, Q, i,j-1)+1 DL(P.Q,i, j) = DL(P, Q,i -2,j -2)+1 DL(P, Q,i-1,j) +1 DL(P, Q, i, j-1) + 1 min otherwise where 1PR]QLi] is 0 if Pli-QB] and 1 otherwise. The middle case covers transpositions, the other two are identical to Levenshtein distance Use an adapted version of the Wagner-Fischer algorithm to compute the Damerau-Levenshtein distance between the words READERS and REDRESS. Show the full array of solutions to subproblems and give an alignment. Also state the Levenshtein distance and a respective alignment between these two words - you do not need to show the full array of intermediate results for this Extra Credit 5. The Damerau-Levenshtein distance https: //en.wikipedia.org/wiki/Damerau%E2%80% 93Levenshtein distance allows the transposition of adjacent characters in addition to the insertion, dele- tion, and substitution allowed by the Levenshtein distance. The distance function can be recursively defined as follows max(i,j) if min(i, j) 0 DL(P, Q,i-1,j) +1 DL(P, Q, i,j-1)+1 DL(P.Q,i, j) = DL(P, Q,i -2,j -2)+1 DL(P, Q,i-1,j) +1 DL(P, Q, i, j-1) + 1 min otherwise where 1PR]QLi] is 0 if Pli-QB] and 1 otherwise. The middle case covers transpositions, the other two are identical to Levenshtein distance Use an adapted version of the Wagner-Fischer algorithm to compute the Damerau-Levenshtein distance between the words READERS and REDRESS. Show the full array of solutions to subproblems and give an alignment. Also state the Levenshtein distance and a respective alignment between these two words - you do not need to show the full array of intermediate results for this