Exercise 5 (20 points) Consider this algorithm: a = 0 for i=0 to n for j=i+1 ton a = a + 2 The objective is to find the total number N of additions performed the above algorithm to execute the statement a = a + 2. Inspire yourself from the analysis of the nave sorting algorithm to: 1) Express N as a function of n. 2) Express the final value of a when the algorithm ends 3) Provide the best bound for N