Consider the Fib Method from the Textbook Shown Below

Consider the fib method from the textbook shown below:
Public static long fib(int n)
{
If (n <= 2)
{
Return 1;
}
Else
{
Return fib(n - 1) + fib(n - 2) ;
}
}
Computing the 7th fibonacci number, fib(7) , recursively computes fib(6) , fib(5) , and fib(4) ___ times respectively.

A) 1, 2, and 3
B) 6, 5, and 4
C) 4, 5, and 6
D) 3, 2, and 1