4. Compute, in terms of the input integer n, how many arithmetic operations (additions, subtractions, multiplications, divisions) are performed by each of the following algorithms. Use the theorem on polynomial orders to find an order for the algorithm segment. (a) Input: n [positive integer] Algorithm body: x := 1 for i = 3 to n x := x · i + i 5 next i Output: x
