Polynomial class $($IN PYTHON$)$

You are to implement a Polynomial class that supports an integer polynomial datatype. Quite

often, such a datatype can be implemented using a list or an array. However, our Polynomials

will be sparse, meaning that a lot of terms will be zero. In such a case, only the nonzero terms

should be stored in the data structure. For this assignment, you must use a linked list to store

the nonzero terms of the polynomial.There are additional requirements on the time and extra space costs of the methods above that you must adhere to as shown in the table below. Extra space cost does not include the input. Below, $n$ is the degree of the polynomial.

$\backslash$table$[[$Method$,$Time Cost,Extra Space Cost$],[$iszero$,O(1),O(1)$