Implement the Deque Abstract Data Type in C++ using Doubly Linked list implementation for the below operations:

• create an empty deque createDeque()
• check if the deque is empty boolean is Empty()
• return the number of elements in the deque int size()
• add an item to the left end enqueueLeft (int num)
• add an item to the right end enqueueRight(int num)
• remove an item from the left end int popLeft()
• remove an item from the right end int popRight()