25.5. This problem is about evaluation of a polynomial cx-1. (a) Here is a little code to do the evaluation. y = c(n); xpow = 1; for i=1:n-1 end xpow = xpow * x; y = y + c(n-1)*xpow; + x"-2 Assuming that x is a scalar, how many flops does this function take, as a function of n? count from (a) to the flop count for Horner's rule, Function