For the algorithm segment, assume that n is a positive integer. (a) Compute the number of additions, subtractions, multiplications, divisions, and comparisons that must be performed when the algorithm segment is executed. For simplicity, however, count only comparisons that occur within if-then and while statements; ignore those implied by for-next loops. (b) Use the theorem on polynomial orders to find an order for the algorithm segment. for j :=1 to (3*n) max := x()] for i:= j + 2 to (3*n) if max