Fill in the order form to get the price

sum <-- 2 * n + 404

for (int i==1; i < n + 1; i++ ) do

sum <-- sum + i + MyA[i] + 404

for (int j = 0; j <= i; j++) do

sum <-- sum * MyA[j] + i + 404 * n

end-for (j)

for (int k = 0; k <= n; k++) do

sum <-- sum * k + MyA[k]

end-for (k)

sum <-- sum + 303

end-for(i)

sum <-- sum + 303 * n

Find an explicit expression for T(n), the count function for the number of times that your operation is executed (is a function of n). It likely starts with one more summations, and ends with a polynomial in n in standardized form (i.e. simplest terms). Show work.