Tilling Problem

#1

problem in recursion solution

#2

Use this recurrance relation.
count(n) = 1, if 1 < = n < m
count(n) = 2, if n = m
count(n) = count(n-1) + count(n-m), if m < n

Please have a look at the implementation of above relation if you are unable to implement it.