c_(1 )= 3\ c_(k)= 3k - c_(k-1) For all k Integers such that K >=2\ Part A:Calculate the value for c_(2)c_(3)c_(4)c_(5)\ \ Part B:

Using iteration, solve the recurrence relation when

n

>=1 (i.e. find an analytic formula for

c_(n)

). Simplify your answer as much as possible, showing your work. In particular, your final answer should not contain \\\\Sigma and \\\\Pi . You should not use any non-arithmetic operations like ceil, floor, round, or any if structure. You must show your work to get full marks.