Instructions say as follows:

For each of the algorithm segments in Exercises 6 through 19, assume that n is a positive integer.

a) Calculate the number The actual number of additions, subtractions, multiplications, divisions, and comparisons to be performed when the algorithm segment is executed. However, for simplicity, only count comparisons that occur within if-then statements; ignore those implied by for-next loops.

b) Use the theorem of orders of polynomials to find an order for each algorithm segment.

ps: please try to explain to the best of your abilities, im trying to learn this better but with the book it feels like im hitting a brickwall

6. for i:=3 to n1 a:=3n+2i1 next