def minimuminsertiondeletion(s, t):
    m=len(s)
    n=len(t)

    dp = [[0 for j in range(n + 1)] for i in range(m + 1)]
    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if s[i - 1] == t[j - 1]:
                dp[i][j] = 1 + dp[i - 1][j - 1]
            else:
                dp[i][j] = max(dp[i][j - 1], dp[i - 1][j])

    maxlength = dp[m][n]

    deletions = m-maxlength
    insertions = n-maxlength

    return deletions, insertions

print(minimuminsertiondeletion("heap", "pea"))