Please use C++

You are expected to create a templated Listdatastructure (up to you on implementation). Subsequentlyyou are to create three child classes of this generic Listclass: Set(ensures unique data), Queue (first in first out), and Stack (last in first out) data structures.

Grading Criteria

Listclass

o[3 Points] Implementation of basic list interface (e.g. add, remove, find)

o[2 Points] Destructor correctly deletes everything in the list without throwing exception

Set class (must inherit from List)

o[3Points] Correctoverride of add/insert (ensures uniqueness)

Queueclass (must inherit from List)

o[1 Point] Private inheritance from List

o[2Points] Correct implementation of basic queue interface (e.g. enqueueanddequeue)

Stackclass (must inherit from List)

o[1 Point] Private inheritance from List

o[2 Points] Correct implementation of basic stack interface (e.g. push and pop)

Demonstration (driver):

oFunctionaltests (positive and negative):

[1 Point] Attempt to add duplicatedata to list

[1 Point] Attempt to add duplicatedata to set (what should happen?)

[1 Point] Demonstrate Enqueue for Queue

[1 Point] Demonstrate Dequeue for Queue

[1 Point] Demonstrate Pushfor Stack

[1 point] Demonstrate Pop for Stack

Assignment Description You are expected to create a templated "List" data structure (up to you on implementation). Subsequently you are to create three child classes of this generic "List" class: Set (ensures unique data). Queue (first in first out), and Stack (last in first out) data structures Notes: 0 points for Hws if code doesn't compile. Up to half points taken off if there's no separation between.Hand.cpp files. Up to 3 points deduction if invariants are not enforced. Up to 1 point deduction if code isn't readable Grading Criteria "List" class 3 Points Implementation of basic list interface (eg add, remove, find) o 12 Pointsj Destructor correctly deletes everything in the list without throwing exception "Set" dass (must inherit from List) - [3 Points) Correct override of add/insert (ensures uniqueness) "Queue class (must inherit from List) o [1 Point] Private inheritance from List - [2 Points) Correct Implementation of basic queue interface (og. enqueue and dequeue) "Stack class (must inherit from List) [1 Point Private inheritance from List 12 Points Correct implementation of basic stack interface (eg push and pop) Demonstration (driver) Functional tests (positive and negative): [1 Point) Attempt to add duplicate data to list 1 Paint Attempt to add "duplicate" data to set (what should happen?) . [1 Point Demonstrate Enqueue for Queue [1 Point Demonstrate Dequeue for Queue 11 Point Demonstrate Push for Stack - [1 point Demonstrate Pop for Stack Assignment Description You are expected to create a templated "List" data structure (up to you on implementation). Subsequently you are to create three child classes of this generic "List" class: Set (ensures unique data). Queue (first in first out), and Stack (last in first out) data structures Notes: 0 points for Hws if code doesn't compile. Up to half points taken off if there's no separation between.Hand.cpp files. Up to 3 points deduction if invariants are not enforced. Up to 1 point deduction if code isn't readable Grading Criteria "List" class 3 Points Implementation of basic list interface (eg add, remove, find) o 12 Pointsj Destructor correctly deletes everything in the list without throwing exception "Set" dass (must inherit from List) - [3 Points) Correct override of add/insert (ensures uniqueness) "Queue class (must inherit from List) o [1 Point] Private inheritance from List - [2 Points) Correct Implementation of basic queue interface (og. enqueue and dequeue) "Stack class (must inherit from List) [1 Point Private inheritance from List 12 Points Correct implementation of basic stack interface (eg push and pop) Demonstration (driver) Functional tests (positive and negative): [1 Point) Attempt to add duplicate data to list 1 Paint Attempt to add "duplicate" data to set (what should happen?) . [1 Point Demonstrate Enqueue for Queue [1 Point Demonstrate Dequeue for Queue 11 Point Demonstrate Push for Stack - [1 point Demonstrate Pop for Stack