Exercise 1.8 Consider the following algorithm to evaluate f(x) = {1, 2;r (Horner's rule): poly = 0; for(i=n; i>=0; i--) poly = 1 * poly + di 3. What is the running time of this algorithm with the following assumptions? What is its big-O notation? Statement Time Unit assignment 1.25 1.75 2.3 1.5 for-next loop set-up each loop