2. What value is returned by the following function? Express your answer as a function of n. Give the worst-case running time using the big-Oh notation. Show individual cost and summations for each line/step and then provide the total asymptotic cost. Algorithm function mystery (n) r=0 for i = 1 to n do for j=i+1 to n do for k:= 1 to j do Cost Times (Summations) return r r: r+1