What will be the base case for this problem

#1

what will be the base case for this problem

#2 
        |  1, 1 < = n < m

count(n) = | 2, n = m
| count(n-1) + count(n-m), m < n

#3

did not understand recursive case is f(n-1)+f(n-4) whats the base case?

#4

how its 2?..

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.