3. To evaluate a polynomial p(x) means to determine its value for a specific value of x. Horner's method is an efficient method of evaluating a polynomial. a. Describe a straightforward O(n) method for evaluating p(x) = ao +ajx + a2x + ... +ax". Justify the Big-Oh bound. b. For Horner's method, we rewrite p(x) as follows: p(x) = ao + x(a1 + x(az + x(az + ... + x(an1 + xan) ...))) Explain how this formula leads to a faster method to evaluate p(x). Give a Big-Oh bound. Justify your answer.| 4. A multiprecision integer is an integer value that is too large to fit in a single computer word. Special algorithms and libraries exist to perform computations with multiprecision integers. Karatsuba's method is an algorithm for multiplying multiprecision integers that is O(ntg 3) where n is the number of bits in the larger of the two integers to be multiplied. Regular "schoolbook multiplication is O(n2). However, I implemented both algorithms and found that for n