I would like to solve the recurrence $T(n,m) = T((n-1),m) + T(n,(m-1))$.
I think the solution is $$O(2^{n+m})$$ because in every step you can reduce either $n$ or $m$ by one or not, but I can not really come up with a proper mathematical argument for this.