Write a class that implements the Queue ADT using doubly linked list that holds integer values according to the following specifications: Node A Node contains a struct value of type int, as well as a link pointer to the next and previous Node. Queue TYPE DATA OPERATIONS I . . front: pointer at the front of the list rear: pointer at the rear of the list Constructor: initialize the front, rear of the queue Destructor isEmpty: returns true if the queue is empty otherwise returns false DeQueue: removes the item from the front of the queue if the queue is not empty EnQueue: store an item at the rear Front: returns the value at the front of the queue Write a declaration of the above class and Implement all member functions of Queue class In the client code "Main" and without adding any other functions to the class do the following: o Declare 2 objects of type Queue o Ask the user to determine number of items for each Queue and read them o determine which queue has the maximum sum (summation of queue contents) and print it along with the queue contents