Hi Guys, can anyone help me with a past paper question i'm looking at for MSc Computing.. it's only worth 4 marks so i'm guessing it's a brief answer but I need to be sure of it incase it comes up again.

Given the following recursive function definition

<CODE>

public static int rec (int n) {

if (n <= 2) return 1;

else return rec(n-1) + rec(n-2);

}

</CODE>

What is the value of rec(5)? Explain your answer.

Is this related to fibonacci numbers?

Any help appreciated (and just incase anyone says they can't help with homework... the year is completed, there aren't any more assignments it's just revision and no masters homework would be this simple :P )