First Part Design and implement a class representing a doubly linked list. The class must have the following requirements 1. The linked list and the nodes must be implemented as a C++ templates 1. The list must be generic - it should not implement arithmetic/logic functions 2. It must include a destructor, a copy constructor and the overloaded operator- 3. It must include methods to insert at the front and at the back of the list 4. It must include a method to return the length of the list 5. It must provide an iterator-based interface for the user from front to back 6. It must include an iterator-based interface for the user from back to front Second Part The implementation of the class LargeInt will use a dynamic physical structure to store the individual digits of an integer, and will provide some basic I'O and arithmetic operations that can be performed on integers In particular, the class should include 1) 2) A default constructor An operator function to overload the operator + 3) An operator function to overload the operator- 4) An operator function to overload the operator > a) Since the Largelnt class does not contain pointers, there is no need for a copy constructor or a destructor b) You can assume huge integers are only positive (or 0) c) Your implementation of the huge integer type must be encapsulated as a C++ class, aggregating a list object for the internal representation of the huge integer value. The huge integer type is not a list, nor does it make sense for it to be derived from a list using inheritance d) Aside from list nodes used only within an encapsulating list template, all data members of classes and templates must be private or protected. Friend operators are permissible, but the huge integer type should absolutely not be declared a friend of the list