In this assignment, you will be implementing an ADT for performing polynomial operations. Recall a polynomial p(x) is given by sum of terms where each term is a product of a non-zero real number coefficient and a non-negative integer power of x. For example, -5x5 +2.5x4 - 3x2 + 2 is a polynomial; it is of degree 5 as it is the highest power in the polynomial. You are given a Java interface for the ADT called Polynomial.java. Java interfaces contain only method declarations. They are implemented by specific classes that implement the interfaces. Note that in any polynomial implementation you just need to keep information regarding the coefficients and the powers of the polynomial. You need to write a class called ArrayPolynomial.java which provides one specific implementation of the Polynomial interface. In this implementation you will be using an array to store the coefficients where the k-th position in the array contains coefficient ofx" in the polynomial. It will be zero if xk term does not exist in the polynomial. We will be providing a starter file for Array Polynomial.java for your lab session later this week when you will be asked to implement some specific things. You can start working on this assignment prior to the lab but you should merge your implementation file with this file prior to working on the lab assignment