Calculate the detailed complexity T(n) of algorithm Mystery in the table below, then determine the expression for T(n) and simplify it to produce a polynomial in n. Assume that the function max has a cost of 10 units after its parameters are evaluated and passed to the function.

Algorithm Mystery (A:array[1. .nl of integer) sum, max integer sum 0 1 2 max 30 3 for i 1 to n Sum for j i to n sum sum A [i] if sum max then. max Sum 9 return max