The best way to find out the answer would be drawing a recursion tree . Let me try :
m(4)
/\
/ \
m(2) \
/\ n(3)
/ \ \
m(0) \ \
/\ n(1) 1+n(2)
/ \ \ \
m(-2) \ 1+n(0) \
/ n(-1) \ 1+n(1)
0 \ 0 \
0 \
1+n(0)
\
0
Add them up , the result should be 4
.