] Please analyze the running time of the algorithm presented in a form of a function below. Your analysis should start with counting key primitive operation and proceeding to the Big-Oh notation. Your final answer should be expressed as a Big-Oh notation. You can consider any multiplication involving an element of the array list[] as the key primitive operation.

double fooFighter (int list[], const int numElements) 

{

 int sample = 0;

 int numSamples = 5;

 int total = 0;

 for (int pass = 1; pass <= numSamples; pass++)

 {

 total += list[pass] * list[pass];

 }

 return static_cast(total) / numSamples;

}