Consider the following pseudo-code: for i=1 to n-1 do { // Assume i, j, k, n are integers for j=1 to i*i { k = 1; while (k < (n-i)) { perform ; k = k + 1; } } } Derive an expression for f(n), the number of times is performed when the algorithm above is run. You do not have to find a bound for f(n).