What is the space complexity of the above dynamic programming implementation of the edit distance problem where “m” and “n” are the lengths of the two strings?$#

• A. O(1)
• B. O(m + n)
• C. O(mn)
• D. None of the mentioned