Please help

8. Mathematically, given a function f, we recursively define f*(n) as follows: if k=1, f(n) = f(n). Otherwise, for k> 1, f(n) = f(fk(n)). Assume that there is an existing function f, which takes in a single integer and returns an integer. Write a recursive function fcomp, which takes in both n and k (k>), and returns f*(n). int f(int n); int fcomp(int n, int k){