Determine complexity of the given algorithm segment

Compute the actual number of additions, subtractions, multiplications, divisions, and comparisons that must be performed when the algorithm segment is executed. (For simplicity, ignore comparisons those implied by for-next loops.) Find an order for the algorithm segment from among the set of power functions. (Assume that n is a positive integer) for i= 1 to n/2 a=n-1 next