ISL 1979 Problem 49

Let there be given two sequences of integers $f_i(1), f_i(2), \cdots (i = 1, 2)$ satisfying: $(i) f_i(nm) = f_i(n)f_i(m)$ if $\gcd(n,m) = 1$ ; $(ii)$ for every prime $P$ and all $k = 2, 3, 4, \cdots$ , $f_i(P^k) = f_i(P)f_i(P^{k-1}) - P^2f(P^{k-2}).$ Moreover, for every prime $P$ : $(iii) f_1(P) = 2P,$ $(iv) f_2(P) < 2P.$ Prove that $|f_2(n)| < f_1(n)$ for all $n$ .