Learning Objectives Writing output to a Text File, Using 1-D Arrays, Using 1-D Arrays as Formal Parameters, More on Modular Programming Definition 1. A univariate polynomial is a mathematical expression in volving a sum of powers in one variable multiplied by coefficients. A poly- nomial in one variable with constant coefficients is given by the expression p(ar) car" n-1 cm-2rn 2 car Co, where the ca's are nu meric values representing the coefficients. The polynomial is said to be an nth-degree polynomial if its highest power is n. For example, 3r4-2z3+r2-1 is a fourth-degree polynomial. To evaluate a univariate polynomial, given a numeric value, the value is substituted for the variable and the expression is evaluated. For example, given the polynomial p (a) 33r4 2a 3 +a2-1, p (-2) 67 since 3 x (-2) 2 x (-2) (-2)2-1 67. A univariate polynomial can be represented as an array of its coefficients in descending powers. For example, the polynomials 4-2a3 r2 -1 and 3a 2 2r 5 are represented as 3, -2, 1,0,-1] and 3r 3,2,-5, respectively. In this project, you will write a program to evaluate a polynomial using Horner's method and without the use of the standard Java Math library Math pow method. The naive way to evaluate a dense polynomial, one with relatively many non-zero coefficients, is to compute the power of each term and multiply it by the coefficient and then sum all the products. A much more efficient approach for evaluating a dense polynomial is Horner's method