also could you help me answer this?

Suppose we use the letter n to refer to the number of elements in an array given to arrayReverse. How many times is the loop comparison performed? Write your answer as a math function on the variable n. For example, if you think the comparison is performed 5x² + 2x + 5 times, you could write f(n) = 5x² + 2x + 5

Consider the following Java method to reverse an array, i.e. rearrange its elements to the opposite order. An array containing {1,3,5} would contain {5,3,1} after being reversed. Write the worst-case runtime efficiency of arrayReverse in BigOh notation