A recurrence relation is an equation that recursively defines a sequence of values, whereby each element of a sequence can be written as a function of preceding element(s); the first element of the sequence will be uniquely defined by an initial value of the recurrence relation. Specifically, if a sequence un can be expressed as a function of only n and the immediate preceding element un-1, i.e., un= g(n, un-1), then we say that u, is a recurrence relation of order 1. The values of the entire sequence can be calculated recursively starting from the initial value say u, and then by u = g(2, ) and more generally un= g(n, un-1) for n = 3, 4, 5,.... (a) Write down an efficient recurrence relation for am. Explain your thought process in words (e.g., using the timeline approach) or prove the result mathematically from first principles. Also write down the initial value for the sequence. (3 marks) (b) Given an effective discrete periodic rate of 4% per period, tabulate the values of an for n=1,2,., 40. (2 marks)