USE Matlab and Really Need Help

1. The polynomial p(x) = C_1 +c_2x+...+c_n x^{n-1} is efficiently computed using the Horner's algorithm, which is based on rewriting p(x) as p(x)=c_1 +x(c_2 +x(c_3 +...+x(c_{n-1} +x c_n))). (See Lecture 20 Live Script for the algorithm itself.) Verify that this method is indeed efficient by counting the number of flops needed to evaluate p(x) for a scalar x using (a) the power form; (b) the Horner's method. This problem is meant to be done by hand. 1. The polynomial p(x) = C_1 +c_2x+...+c_n x^{n-1} is efficiently computed using the Horner's algorithm, which is based on rewriting p(x) as p(x)=c_1 +x(c_2 +x(c_3 +...+x(c_{n-1} +x c_n))). (See Lecture 20 Live Script for the algorithm itself.) Verify that this method is indeed efficient by counting the number of flops needed to evaluate p(x) for a scalar x using (a) the power form; (b) the Horner's method. This problem is meant to be done by hand