WHAT_IS_THE_SPACE_COMPLEXITY_OF_THE_ABOVE_DYNAMIC_PROGRAMMING_IMPLEMENTATION_OF_THE_LONGEST_COMMON_SUBSEQUENCE_PROBLEM_WHERE_LENGTH_OF_ONE_STRING_IS_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ‚À´M‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖŒÄ_AND_THE_LENGTH_OF_THE_OTHER_STRING_IS_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ‚À´N‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖŒÄ??$#

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