What is the time complexity of the following dynamic programming implementation of the edit distance problem where “m” and “n” are the lengths of two strings?

• A. O(1)
• B. O(m + n)
• C. O(mn)
• D. O(n)View Answer