function F(n) if n = 1 then return a return F(n - 1) + cn + k

Consider the recursive function listed below. The function takes one positive integer n as input, and a, c and k are numerical constants function F(n) if n 1 then return da return F(n -1) + cn +k (a) Set up the recurrence relation for the function's value, F(n), and solve it to derive the ?st show working for how the closed-form was (b) Set up the recurrence relation for the number of multiplications made by the algorithm, closed-form.You mu derived M(n). Then find the closed-form for it. You must show working. (c) Finally, state the ? expression for the time complexity of the algorithm