a = 0 Consider this algorithm: for i=1 to n for ji to n a =a+3 The objective is to find the total number N of additions performed by the above algorithm to execute the statement a = a + 3 during the execution of the algorithm. Inspire yourself from the analysis of the nave sorting algorithm to: 1) Express N as a function of n (for clarity, consider using a table like in M1:Homework). 2) Provide the best bound (growth) for N. Follow all steps used in the lecture and justify carefully your answers Activate Windows