Please program in C++Programming Language: For this assignment, you need to implement a link-based Queue ADT. To complete this, you will need the following: A Node ADT which will have two attributes - a data attribute and a pointer attribute. Remember the Node has to be an ADT, so that it can hold any kind of data. 1. You can choose to use this node as both a data and a head-pointing node or as a simple data node in which case you will need a new head pointing node. In the head-pointing node, you will need to implement both front and rear pointers. 2. A Singly Linked List ADT which will be composed of one or more of your nodes. Implement the most common linked-list behaviors as explained in class-new list, add anywhere, delete anywhere, find anywhere, count of items in the list, empty the list, etc 3. Finally, implement a Queue ADT based on your singly linked list which will implement the most common Queue operations like enqueue, dequeue, front, rear, empty etc 4. 5. Ensure that your Node, List and Queue ADTs are mimimal and cohesive with adequate walls around them. Define interfaces as needed, so you can reuse them in all your subsequent assignments Then write a main that will demonstrate the capabilities of you Queue ADT with different types of data- numbers, strings and your currency objects. 6. Please demonstrate: EXE works without a hitch, MSVC project structure, code styling, commenting Queue template which only exposes Queue related behaviors and Demonstration of Queue ADT in main