Given the following function that evaluates a polynomial whose coefficients are stored in an array:

Given the following function that evaluates a polynomial whose coefficients are stored in an array:  

double evaluate(double[] coefficients, double x)

{  

double result = coefficients[0];  

double power = 1;  

for (int i = 1; i < coefficients.length; i++) 

 {    

power = power * x; 

    result = result + coefficients[i] * power; 

 } 

 return result;

}

Let n be the length of the array. Determine the number of additions and multiplications that are performed in the worst case as a function of n.