Calculate the time complexity of this algorithm

Consider the following algorithm. Algorithm foo(n) if n=0 then return ! else fori1 to n dox+x/i return r The time complexity of this algorithm is given by the following recurrence equation: f(0) ci f(n)- f(n -1) +cn + c3, for n> 0 where ci, c2, and c are constants. Solve the recurrence equation and give the value of f (n) and its order using big-Oh notation. You must explain how you solved the recurrence equation