input: Write a function to compute the edit distance between two strings in Python. If either string is empty, the edit distance is the length of the other string. Otherwise, the function should use dynamic programming to fill a 2D array where each cell represents the edit distance for the substrings up to that point. The function should return the final edit distance.
  assert editDistance("kitten", "sitting", 6, 7)==3
  assert editDistance("intention", "execution", 9, 10)==5
  assert editDistance("horse", "ros", 5, 3)==3
  assert editDistance("sunday", "saturday", 6, 8)==3
  assert editDistance("", "python", 0, 6)==6
  assert editDistance("code", "", 4, 0)==4
output: def editDistance(str1, str2, m, n):
      dp = [[0 for x in range(n + 1)] for x in range(m + 1)]
      
      for i in range(m + 1):
          for j in range(n + 1):
              if i == 0:
                  dp[i][j] = j
              elif j == 0:
                  dp[i][j] = i
              elif str1[i-1] == str2[j-1]:
                  dp[i][j] = dp[i-1][j-1]
              else:
                  dp[i][j] = 1 + min(dp[i][j-1], dp[i-1][j], dp[i-1][j-1])
      
      return dp[m][n]