it is a analysis and design of Algorithms question, provide answer accordingly

Q.9 What is the asymptotic order for the number of additions in the program given in Q.8 above? Q.9 (b) Consider the following pseudocode and determine the order of the runni time of this function. Function SE2228 (n): b=0 for in range(n): b=b=(i*i)+i return b Q.9 What is the asymptotic order for the number of additions in the program given in Q.8 above? Q.9 (b) Consider the following pseudocode and determine the order of the running time of this function. Function SE2228 (n): b=0 for i in range(n): b=b=(i*i)+i return b