Find the function that best represents the temporal order of the following algorithms in the worst case.Count the operations of addition (+) and multiplication (×). Suppose that the array K contains n...

Find the function that best represents the temporal order of the following algorithms in the worst case.Count the operations of addition (+) and multiplication (×). Suppose that the array K contains n values.polyEval(K: whole array, x: whole): whole

  y ← K[n − 1]

for i ← n − 2, n − 3 .. 0

y ← y × x + K[i]

end for

return y

end polyEval

justify your answer please