Consider the following dynamic programming implementation of the edit distance problem: Which of the following lines should be added to complete the above code?

• A. arr[i-1][j] = min
• B. arr[i][j-1] = min
• C. arr[i-1][j-1] = min
• D. arr[i][j] = minView Answer