public static int rFibNum$($int a$,$ int b$,$ int n$)$

$\{$

if$($n $==1)$ return a;

else

if$($n$==2)$ return b;

else return rFibNum$($a$,$ b$,$ n$-1)+$rFibNum$($a$,$ b$,$

n$-2)$;

$\}$

How many base cases are there in the recursive method

above?

$2$

$0$

$3$

$1$