Can anyone help me with this C++ problem.

1. Consider the following function:

int func(int list[], int size)

{

int sum = 0;

for (int index = 0; index < size; index++)

sum = sum + list[index];

return sum;

}

1. Find the number of operations executed by the function func() if the value of size is 10.
2. Find the number of operations executed by the function func() if the value of size is n.
3. What is the order (Big-O notation) of the function func()?