b. (30 points) If the algorithm you designed is in (n?), design a linear algorithm for this problem using C++, also explain why it is a linear algorithm. a. (30 points) Design a brute-force algorithm (using C++) for computing the value of a polynomial p(x) = anx" + an-13"-1+ ... + x + ao at a given point X, and determine its efficiency class. (Assuming that the factors 2o, "", an are saved in an array a[O..n-1).)