[5 points] Analysis of pseudocode. In this problem, we will investigate the worst-case running time for the following code snippet. Assume evaluating a function f(i) in the pseudo-code below takes (i) time. 1. i=1 2. sum =0 3. for i=1 to n 4. sum +=f(i) What is the running time expressed in asymptotic notation? Justify your