How do I solve this recursion?

Question

What is the value of F(n, m)?

Function F(n, m : integer) : integer;
begin
    if(n <= 0) or (m <= 0) then F:=1
    else
    F := F(n-1, m) + F(n, m-1);
end;

Answer 1

inorder to upload an image, it asks source , size ,URL

whats ol that???

Am not aware of how to upload an image taken, if u would help

il upload my working for u

Comments

there is one tab "upload" in the pop up
click the upload tab, you can upload your image there.

Answer 2

I have constructed a recursion tree for F(3,3)

Correct me if I am wrong.

Comments

Thanks, Arnab. You are correct on F(3,3) but I want to know a general equation for this recursion, that tells how many times the function F will be called on F(n, m). I tried deriving one using Mathematical Induction but failed.

---

What general equation u want? U already written general form. rt?

---

He wants the number of function calls in the form of n and m.