Consider the following recursive C function.
void get(int n)
{
if (n<1) return;
get (n-1);
get (n-3);
printf("%d", n);
}
If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$?
- $15$
- $25$
- $35$
- $45$