psolve in python

Given a linear recursive equation of the form f(n)=a(f(n/b)) and a base case condition f(c)=1, where a,b and c are given. Find the value of f(n) and the number of recursive calls for the given ' n '. HINT: You do not have to find the value of f(n), only the number of recursive calls. It is given that the answer always exists and is an integer. Input Format The first line contains three space separated integers, a,b and c. Contest ends in The second line contains the value n. Constraints Submissions: 5 Max Score: 10 Difficulty: Mediu 1