Create a Circular Doubly Linked List, include class declaration and the functions being implemented.

1. Declares a private class "Node"

2. Has a constructor and destructor, ensure dynamic memory is free.

3. Must include the following functions:

void addItem (Item a) //will add a new node to the end of the linked list with value a

void increaseHead() //advance head to next node

void decreaseHead() //move head to previous node

void swap(unsigned int src,unsigned int dst) //swap the data in the 2 nodes (easier than swapping the nodes themselves)

Item getData(unsigned int i) const //return the data associated in the i-th node of the list