(10 pts.) Assume that n is a positive integer. Consider the…

(10 pts.) Assume that n is a positive integer. Consider the algorithm segment.          a) Compute the actual number of elementary operations (additions, subtractions, multiplications, divisions, and comparisons) that are performed when the algorithm segment is executed. I suggest you really think about how many times the inner loop is done (and how many operations are done within it) for the first couple of values of i and then for the last value of n so that you can see a pattern. Note that there is a line of code outside of the inner loop that is executed (and must be counted) each time the outer loop is run.   b) Use the theorem on polynomial orders to find an order for the algorithm segment.